On the minimum norm solution of linear programs
From MaRDI portal
Publication:1411463
DOI10.1023/A:1022457904979zbMath1043.90046OpenAlexW1560485286MaRDI QIDQ1411463
Liqun Qi, Christian Kanzow, Hou-Duo Qi
Publication date: 29 October 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022457904979
Related Items
Computing minimum norm solution of linear systems of equations by the generalized Newton method, On the solution set of convex problems and its numerical application, Projection-based local and global Lipschitz moduli of the optimal value in linear programming, Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation, On an inverse linear programming problem, Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming, Minimum norm solution to the absolute value equation in the convex case, An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming, Unnamed Item, Experience in organizing hybrid parallel calculations in the Evtushenko-Golikov method for problems with block-angular structure, A first order method for finding minimal norm-like solutions of convex optimization problems, Generalized Newton method for linear optimization problems with inequality constraints, Some techniques for solving absolute value equations, Regularization and normal solutions of systems of linear equations and inequalities, Augmented Lagrangian method for large-scale linear programming problems, The noncooperative transportation problem and linear generalized Nash games, Minimum norm solution to the positive semidefinite linear complementarity problem, A Newton method for linear programming, Superlinear convergence of a Newton-type algorithm for monotone equations, A strongly convergent proximal bundle method for convex minimization in Hilbert spaces, Multicategory proximal support vector machine classifiers, Multicategory proximal support vector machine classifiers, An explicit parallel algorithm for solving variational inclusion problem and fixed point problem in Banach spaces, Finding the projection of a given point on the set of solutions of a linear programming problem, Unnamed Item, On the optimal correction of infeasible systems of linear inequalities, Tikhonov regularization for infeasible absolute value equations, A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- A semismooth equation approach to the solution of nonlinear complementarity problems
- On finite termination of an iterative method for linear complementarity problems
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Normal solutions of linear programs
- A nonlinear equation for linear programming
- Nonlinear Perturbation of Linear Programs
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
