Locating the least 2-norm solution of linear programs via a path-following method

DOI10.1137/S1052623401386368MaRDI QIDQ2784443zbMATH OpenOpenAlexWikidataFDO

Authors Duan Li, Yun-Bin Zhao

Publication date 23 April 2002

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623401386368

zbMATH Keywords

least 2-norm solutionlinear programmingpath-following algorithmregularized central path

Mathematics Subject Classification ID

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)

Recommendations

• A finite algorithm for the least two-norm solution of a linear program¹
• A new result in the theory and computation of the least-norm solution of a linear program
• A High-Order Path-Following Method for Locating the Least 2-Norm Solution of Monotone LCPs
• A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
• Interior Dual Least 2-Norm Algorithm for Linear Programs

Cited in

(4)

• A High-Order Path-Following Method for Locating the Least 2-Norm Solution of Monotone LCPs
• A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
• A finite algorithm for the least two-norm solution of a linear program¹
• On a special class of regularized central paths for semidefinite programs

This page was built for publication: Locating the least 2-norm solution of linear programs via a path-following method

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