An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
From MaRDI portal
Publication:2477012
DOI10.1007/s10589-007-9048-6zbMath1171.90546MaRDI QIDQ2477012
Hande Y. Benson, David F. Shanno
Publication date: 12 March 2008
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9048-6
Related Items
Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, Warmstarting for interior point methods applied to the long-term power planning problem, Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- Interior-point algorithms, penalty methods and equilibrium problems
- Modified barrier functions (theory and methods)
- Warm start of the primal-dual method applied in the cutting-plane scheme
- An interior-point algorithm for nonconvex nonlinear programming
- Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs
- A primal-dual infeasible-interior-point algorithm for linear programming
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization
- Mersenne twister
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Reoptimization With the Primal-Dual Interior Point Method
- LOQO:an interior point code for quadratic programming
- The Complex Zeros of Random Polynomials
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
