A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
From MaRDI portal
Publication:3648621
DOI10.1080/02331930701762837zbMath1175.90289OpenAlexW2044776869MaRDI QIDQ3648621
Publication date: 27 November 2009
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701762837
Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Cites Work
- Least-norm linear programming solution as an unconstrained minimization problem
- A Newton method for linear programming
- A new result in the theory and computation of the least-norm solution of a linear program
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
- On the minimum norm solution of linear programs
- On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
- Analyticity of the central path at the boundary point in semidefinite programming
- High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
- On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems
- Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
- Normal solutions of linear programs
- A finite algorithm for the least two-norm solution of a linear program1
- A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs
- Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition
- Two simple proofs for analyticity of the central path in linear programming.
- High order long-step methods for solving linear complementarity problems
This page was built for publication: A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
