Augmented Lagrangian method for large-scale linear programming problems
- 1 August 2005
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 20 (4-5) , 515-524
Abstract
The augmented Lagrangian and Newton methods are used to simultaneously solve the primal and dual linear programming problems. The proposed approach is applied to the primal linear programming problem with a very large number (≈106) of nonnegative variables and a moderate (≈103) number of equality-type constraints. Computation results such as the solution of a linear programme with 10 million primal variables are presented.Keywords
This publication has 6 references indexed in Scilit:
- A Newton Method for Linear ProgrammingJournal of Optimization Theory and Applications, 2004
- On the Minimum Norm Solution of Linear ProgramsJournal of Optimization Theory and Applications, 2003
- A finite newton method for classificationOptimization Methods and Software, 2002
- The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm2000
- The BPMPD interior point solver for convex quadratic problemsOptimization Methods and Software, 1999
- Exact Penalty Functions in Constrained OptimizationSIAM Journal on Control and Optimization, 1989