A Newton method for linear programming
From MaRDI portal
Publication:704747
DOI10.1023/B:JOTA.0000026128.34294.77zbMath1140.90467MaRDI QIDQ704747
Publication date: 19 January 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Methods of quasi-Newton type (90C53)
Related Items
Linear programming with nonparametric penalty programs and iterated thresholding, Computing minimum norm solution of linear systems of equations by the generalized Newton method, Zonotopes and the LP-Newton method, An interior-point algorithm for solving inverse linear optimization problem, Projective-dual method for solving systems of linear equations with nonnegative variables, A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality, On an inverse linear programming problem, An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side, Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming, Solving the general quadratic programming problem in a finite number of steps, Newton-based approach to solving K-SVCR and twin-KSVC multi-class classification in the primal space, Minimum norm solution to the absolute value equation in the convex case, Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions, New numerical methods and some applied aspects of the p-regularity theory, A constraint-reduced variant of Mehrotra's predictor-corrector algorithm, Newton-type method for solving systems of linear equations and inequalities, Locally polynomial method for solving systems of linear inequalities, An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming, Generalized Newton method for linear optimization problems with inequality constraints, Regularization and normal solutions of systems of linear equations and inequalities, Augmented Lagrangian method within L-shaped method for stochastic linear programs, Semilocal convergence analysis of \(S\)-iteration process of Newton-Kantorovich like in Banach spaces, Augmented Lagrangian method for large-scale linear programming problems, Minimum norm solution to the positive semidefinite linear complementarity problem, A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations, Optimal correction of the absolute value equations, 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, A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs, Solution of a contact elasticity problem with a rigid inclusion, Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- 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
- Arbitrary-norm separating plane
- Piecewise-linear pathways to the optimal solution set in linear programming
- On the minimum norm solution of linear programs
- Search for normal solutions in linear programming problems
- Minimization of \(SC^ 1\) functions and the Maratos effect
- Minimization of functions having Lipschitz continuous first partial derivatives
- Normal solutions of linear programs
- A nonlinear equation for linear programming
- Nonlinear Perturbation of Linear Programs
- 10.1162/15324430152748218
- Las Vegas algorithms for linear and integer programming when the dimension is small
- A finite newton method for classification
- Parallel Gradient Distribution in Unconstrained Optimization
