Least-norm linear programming solution as an unconstrained minimization problem
From MaRDI portal
Publication:593978
DOI10.1016/0022-247X(83)90283-4zbMath0525.90064MaRDI QIDQ593978
Publication date: 1983
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05)
Related Items
Sparsity-preserving SOR algorithms for separable quadratic and linear programming, Linearly constrained convex programming as unconstrained differentiable concave programming, On the Lipschitz behavior of optimal solutions in parametric problems of quadratic optimization and linear complementarity, On piecewise quadratic Newton and trust region problems, Unconstrained convex programming approach to linear programming, A Gauss-Newton method for convex composite optimization, An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions, A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs, A dual differentiable exact penalty function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- Solution of symmetric linear complementarity problems by iterative methods
- Bounds for error in the solution set of a perturbed linear program
- Complementary pivot theory of mathematical programming
- Nonlinear Programming Problems with Stochastic Objective Functions
- Duality in quadratic programming
- Nonlinear Perturbation of Linear Programs
- Iterative Solution of Linear Programs
- A Characterization of Stability in Linear Programming
- The conjugate gradient method in extremal problems
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
