Generalized Newton method for linear optimization problems with inequality constraints
From MaRDI portal
Publication:483411
DOI10.1134/S0081543814020096zbMath1302.90123MaRDI QIDQ483411
A. I. Golikov, Yuri G. Evtushenko
Publication date: 17 December 2014
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
piecewise quadratic function; generalized Newton method; linear programming problem; unconstrained maximization
Related Items
Regularization and normal solutions of systems of linear equations and inequalities, On an inverse linear programming problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior penalty functions and duality in linear programming
- A Newton method for linear programming
- Finding the projection of a given point on the set of solutions of a linear programming problem
- On the minimum norm solution of linear programs
- On quadratic and complete quadratic problems of convex programming
- Solution method for a large-scale linear programming problems
- Parallel implementation of Newton’s method for solving large-scale linear programs
- A finite newton method for classification
- Quadratic approximation of penalty functions for solving large-scale linear programs