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

DOI10.1134/S0081543808060084zbMATH Open1178.90264MaRDI QIDQ735648FDOQ735648

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)

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

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

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)