A finite algorithm for the least two-norm solution of a linear program1

DOI10.1080/02331938708843296zbMath0637.90065OpenAlexW2059496213MaRDI QIDQ3778542

Stefano Lucidi

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938708843296

zbMATH Keywords

successive overrelaxationseparable quadratic programleast 2-norm solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Linear programming (90C05)

Related Items

Finding normal solutions in piecewise linear programming, Iterative schemes for the least 2-norm solution of piecewise linear programs, A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs

Cites Work

• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• On the global stabilization of locally convergent algorithms
• Solution of symmetric linear complementarity problems by iterative methods
• A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
• Normal solutions of linear programs
• Nonlinear Perturbation of Linear Programs
• Unnamed Item