On using exterior penalty approaches for solving linear programming problems
From MaRDI portal
Publication:5945315
DOI10.1016/S0305-0548(00)00025-3zbMath1017.90062MaRDI QIDQ5945315
Burak Özdaryal, Naguib Attia, Hanif D. Sherali, Warren P. Adams
Publication date: 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items
Three nearly scaling-invariant versions of an exterior point algorithm for linear programming, Exterior point simplex-type algorithms for linear and network optimization problems, Improving a primal–dual simplex-type algorithm using interior point methods, An exterior simplex type algorithm for the minimum cost network flow problem
Uses Software
Cites Work
- Exterior point algorithms for nearest points and convex quadratic programs
- A new polynomial-time algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- An infeasible (exterior point) simplex algorithm for assignment problems
- Conjugate gradient methods using quasi-Newton updates with inexact line searches
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- An exterior point simplex algorithm for (general) linear programming problems
- An exterior point method for the convex programming problem
- Stable exponential-penalty algorithm with superlinear convergence
- Multiplier and gradient methods
- An exterior-point method for linear programming problems
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On Penalty and Multiplier Methods for Constrained Minimization
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
