Warm-Start Strategies in Interior-Point Methods for Linear Programming

DOI10.1137/S1052623400369235zbMath1007.90079MaRDI QIDQ2784437

E. Alper Yıldırım, Stephen J. Wright

Publication date: 23 April 2002

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

linear programminginterior-point methodsreoptimizationwarm-start

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (34)

An \(\mathrm S\ell _1 \mathrm{LP}\)-active set approach for feasibility restoration in power systems ⋮ On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ A decomposition-based crash-start for stochastic programming ⋮ A Newton's method for perturbed second-order cone programs ⋮ Accurate On-line Support Vector Regression ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ Non-negatively constrained image deblurring with an inexact interior point method ⋮ Incremental optimal process excitation for online system identification based on evolving local model networks ⋮ Warm start by Hopfield neural networks for interior point methods ⋮ Techniques for exploring the suboptimal set ⋮ Initial guess sensitivity in computational optimal control problems ⋮ Optimization problem coupled with differential equations: a numerical algorithm mixing an Interior-point method and event detection ⋮ An interior-point implementation developed and tuned for radiation therapy treatment planning ⋮ Could we use a million cores to solve an integer program? ⋮ Towards an efficient augmented Lagrangian method for convex quadratic programming ⋮ Hopfield neural networks in large-scale linear optimization problems ⋮ Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems ⋮ A new warmstarting strategy for the primal-dual column generation method ⋮ Interior Point Methods for Nonlinear Optimization ⋮ An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming ⋮ A warm-start approach for large-scale stochastic linear programs ⋮ Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ FORCES NLP: an efficient implementation of interior-point methods for multistage nonlinear nonconvex programs ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Warmstarting for interior point methods applied to the long-term power planning problem ⋮ Constrained graph layout by stress majorization and gradient projection ⋮ Advances in the simulation of viscoplastic fluid flows using interior-point methods ⋮ Mixed integer nonlinear programming using interior-point methods ⋮ Multiplicative update rules for incremental training of multiclass support vector machines ⋮ Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension ⋮ SICOpt: Solution approach for nonlinear integer stochastic programming problems ⋮ Move blocked model predictive control with guaranteed stability and improved optimality using linear interpolation of base sequences ⋮ Active-set prediction for interior point methods using controlled perturbations

This page was built for publication: Warm-Start Strategies in Interior-Point Methods for Linear Programming