Convergence of suitable affine subspace method for finding the least distance to a simplex

MaRDI QIDQ3408897zbMATH OpenFDO

Authors E. A. Nurminskii

Publication date 6 November 2006

zbMATH Keywords

affine subspace methodalgorithm convergencefinite-dimensional Euclidean spacesimplex

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Computational aspects related to convexity (52B55) Minimax problems in mathematical programming (90C47) Programming in abstract spaces (90C48)

Recommendations

• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
• scientific article; zbMATH DE number 3924512
• Accelerated parallel projection method for solving the shortest distance problem
• A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
• scientific article; zbMATH DE number 4043137

Cited in

(4)

• Computation of the longest segment of a given direction in a simplex
• The problem of projecting the origin of Euclidean space onto the convex polyhedron
• Single-projection procedure for linear optimization
• Algorithms for projecting a point onto a level surface of a continuous function on a compact set

This page was built for publication: Convergence of suitable affine subspace method for finding the least distance to a simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408897)