Numeric computation of the projection of a point onto a polyhedron

DOI10.1007/BF00935003zbMath0518.65044MaRDI QIDQ1054128

A. Laratta, Mario Arioli, Ornella Menchi

Publication date: 1984

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

error boundsorthogonal factorizationactive set methodsnumerical experimentation on test problemsprojection onto polyhedrons

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Euclidean analytic geometry (51N20)

Related Items

Error analysis of algorithms for computing the projection of a point onto a linear manifold ⋮ Factorization and cutting planes for completely positive matrices by copositive projection ⋮ On the error estimate for the projection of a point onto a linear manifold ⋮ A dual gradient-projection method for large-scale strictly convex quadratic problems ⋮ Error analysis of an algorithm for solving an undetermined linear system ⋮ Perturbation analysis for the projection of a point to an affine set ⋮ A big-M type method for the computation of projections onto polyhedrons ⋮ Direct methods for the solution of linear systems

Cites Work

• A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
• Sur l'approximation d'équtions et inéquations aux dérivées partielles non linéaires de type monotone
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• On the Numerical Solution of Constrained Least-Squares Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item