On using exterior penalty approaches for solving linear programming probelems

Computers and Operations Research

Volumn 28, Issue 11, 2001, Pages 1049-1074

  Sherali, Hanif D ^a   Özdaryal, Burak ^a   Adams, Warren P ^b   Attia, Naguib ^c  

^a Virginia Polytechnic Institute and State University   (United States)

^b CLEMSON UNIVERSITY   (United States)

^c JOHNSON C SMITH UNIVERSITY   (United States)

Author keywords

Augmented Lagrangian approach; Exterior penalty functions; Linear programming

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES; STATISTICAL METHODS; THEOREM PROVING;

AUGMENTED LAGRANGIAN APPROACH;

OPERATIONS RESEARCH;

LINEAR PROGRAMING;

EID: 0035452325     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00025-3     Document Type: Article

References (30)

1. A new polynomial-time algorithm for linear programming
2. On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method
3. Interior-point polynomial algorithms in convex programming
4. Computational experience with a primal-dual interior point method for linear programming
5. Stable exponential-penalty algorithm with superlinear convergence
6. An infeasible (Exterior point) simplex algorithm for assignment problems
7. An exterior point simplex algorithm for (general) linear programming problems
8. Exterior point algorithms for nearest points and convex quadratic programs
9. An exterior-point polytope sliding and deformation algorithm for linear programming problems
10. An exterior point method for convex programming problems
11. An exterior-point method for linear programming problems
12. On penalty and multiplier methods for constrained minimization
13. Multiplier and gradient methods
14. A method for nonlinear constraints in minimization problems
15. A class of convergent primal-dual subgradient algorithms for decomposable convex programs
16. A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
17. Convergence properties of an augmented Lagrangian algorithm for optimization with a combination of general equality and linear constraints
18. A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
19. Penalty/barrier multiplier methods for convex programming problems
20. On the solution of large quadratic programming problems with bound constraints
21. Conjugate gradient methods using quasi-Newton updates with inexact line searches
22. Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs