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.90546OpenAlexW1970065252MaRDI QIDQ2477012
David F. Shanno, Hande Y. Benson
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
A fast first-order optimization approach to elastoplastic analysis of skeletal structures, On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, Using the primal-dual interior point algorithm within the branch-price-and-cut method, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, Inference methods for CRFs with co-occurrence statistics, An interior point method for isogeometric contact, Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion, Could we use a million cores to solve an integer program?, Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems, A non-interior implicit smoothing approach to complementarity problems for frictionless contacts, An augmented Lagrangian filter method, A multilevel analysis of the Lasserre hierarchy, A framework for solving mixed-integer semidefinite programs, A new warmstarting strategy for the primal-dual column generation method, Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, A warm-start approach for large-scale stochastic linear programs, Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization, Infeasible constraint-reduced interior-point methods for linear optimization, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, Warmstarting for interior point methods applied to the long-term power planning problem, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, Another look at linear programming for feature selection via methods of regularization, Mixed integer nonlinear programming using interior-point methods, Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension, An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints, Active-set prediction for interior point methods using controlled perturbations
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
