A Newton method for linear programming
From MaRDI portal
Publication:704747
DOI10.1023/B:JOTA.0000026128.34294.77zbMATH Open1140.90467MaRDI QIDQ704747FDOQ704747
Authors: O. L. Mangasarian 
Publication date: 19 January 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 2208632
- Application on Newton and augmented Lagrangian methods to linear programming
- Augmented Lagrangian method for large-scale linear programming problems
- Generalized Newton method for linear optimization problems with inequality constraints
- Interior Dual Least 2-Norm Algorithm for Linear Programs
Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Methods of quasi-Newton type (90C53)
Cites Work
- An introduction to support vector machines and other kernel-based learning methods.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- 10.1162/15324430152748218
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Arbitrary-norm separating plane
- A finite newton method for classification
- On the minimum norm solution of linear programs
- Parallel Gradient Distribution in Unconstrained Optimization
- Nonlinear Perturbation of Linear Programs
- Minimization of \(SC^ 1\) functions and the Maratos effect
- 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
- Piecewise-linear pathways to the optimal solution set in linear programming
- Search for normal solutions in linear programming problems
- Normal solutions of linear programs
- A nonlinear equation for linear programming
Cited In (39)
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- New numerical methods and some applied aspects of the p-regularity theory
- Zonotopes and the LP-Newton method
- Optimal correction of the absolute value equations
- An interior-point algorithm for solving inverse linear optimization problem
- Exit from Singularity. New Optimization Methods and the p-Regularity Theory Applications
- A penalty approach to linear programs with many two-sided constraints
- Newton-type method for solving systems of linear equations and inequalities
- A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
- Minimum norm solution to the absolute value equation in the convex case
- A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations
- Application on Newton and augmented Lagrangian methods to linear programming
- Solution of a contact elasticity problem with a rigid inclusion
- On the optimal correction of infeasible systems of linear inequalities
- On an inverse linear programming problem
- Linear programming with nonparametric penalty programs and iterated thresholding
- Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs
- Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions
- Title not available (Why is that?)
- Newton-based approach to solving K-SVCR and twin-KSVC multi-class classification in the primal space
- An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side
- Newtonian program analysis via tensor product
- Projective-dual method for solving systems of linear equations with nonnegative variables
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- Generalized Newton method for linear optimization problems with inequality constraints
- A first-order smoothing technique for a class of large-scale linear programs
- Finding the projection of a given point on the set of solutions of a linear programming problem
- Regularization and normal solutions of systems of linear equations and inequalities
- Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming
- Title not available (Why is that?)
- Augmented Lagrangian method for large-scale linear programming problems
- On first experiences with the implementation of a Newton based linear programming approach
- Minimum norm solution to the positive semidefinite linear complementarity problem
- Semilocal convergence analysis of \(S\)-iteration process of Newton-Kantorovich like in Banach spaces
- Solving the general quadratic programming problem in a finite number of steps
- Augmented Lagrangian method within L-shaped method for stochastic linear programs
- Computing minimum norm solution of a specific constrained convex nonlinear problem
- Locally polynomial method for solving systems of linear inequalities
- Computing minimum norm solution of linear systems of equations by the generalized Newton method
Uses Software
This page was built for publication: A Newton method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704747)
