Iterative schemes for the least 2-norm solution of piecewise linear programs

DOI10.1016/0024-3795(93)00314-PzbMath0835.90067MaRDI QIDQ1902107

Krzysztof C. Kiwiel

Publication date: 14 November 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

Lagrange multipliersconvex polyhedral functionlarge sparse linear programs

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Cites Work

• Unnamed Item
• Sparsity-preserving SOR algorithms for separable quadratic and 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
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
• A row relaxation method for large \(l_ 1\) problems
• Resolving degeneracy in quadratic programming
• Finding normal solutions in piecewise linear programming
• Iterative Methods for Large Convex Quadratic Programs: A Survey
• The Simplex Method for Quadratic Programming
• A Descent Algorithm for Minimizing Polyhedral Convex Functions
• Equivalence of some quadratic programming algorithms
• Inertia-Controlling Methods for General Quadratic Programming
• Normal solutions of linear programs
• A finite algorithm for the least two-norm solution of a linear program¹
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• Nonlinear Perturbation of Linear Programs