Finding the projection of a given point on the set of solutions of a linear programming problem

DOI10.1134/S0081543808060084MaRDI QIDQ735648zbMATH OpenFDO

Authors A. I. Golikov, Yu. G. Evtushenko

Publication date 23 October 2009

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 3991280
• Projection algorithms for linear programming
• scientific article; zbMATH DE number 4211801
• On a finite-dimensional variant of the method of the projection of the remote point
• scientific article; zbMATH DE number 4185389

Cites work

• A Newton method for linear programming
• A finite newton method for classification
• On the minimum norm solution of linear programs
• The BPMPD interior point solver for convex quadratic problems

Cited in

(5)

• Regularization and normal solutions of systems of linear equations and inequalities
• A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
• On a finite-dimensional variant of the method of the projection of the remote point
• Finding the orthogonal projection of a point onto an affine subspace
• Generalized Newton method for linear optimization problems with inequality constraints

This page was built for publication: Finding the projection of a given point on the set of solutions of a linear programming problem

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