Warm start of the primal-dual method applied in the cutting-plane scheme
From MaRDI portal
Publication:1290656
DOI10.1007/BF02680554zbMath0920.90102MaRDI QIDQ1290656
Publication date: 15 September 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items (27)
Large-scale optimization with the primal-dual column generation method ⋮ On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ Warm start by Hopfield neural networks for interior point methods ⋮ A heuristic for the long-term electricity generation planning problem using the Bloom and Gallant formulation ⋮ Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion ⋮ IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming ⋮ Could we use a million cores to solve an integer program? ⋮ An interior point cutting plane heuristic for mixed integer programming ⋮ An interior-point Benders based branch-and-cut algorithm for mixed integer programs ⋮ A non-interior implicit smoothing approach to complementarity problems for frictionless contacts ⋮ 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 ⋮ A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem ⋮ Interior Point Methods for Nonlinear Optimization ⋮ An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming ⋮ A specialized primal-dual interior point method for the plastic truss layout optimization ⋮ A warm-start approach for large-scale stochastic linear programs ⋮ Constraint programming approaches to disassembly line balancing problem with sequencing decisions ⋮ 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 ⋮ 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 ⋮ Active-set prediction for interior point methods using controlled perturbations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cutting planes and column generation techniques with the projective algorithm
- On the augmented system approach to sparse least-squares problems
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- A weighted least squares study of robustness in interior point linear programming
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Multiple centrality corrections in a primal-dual method for linear programming
- Primal-dual target-following algorithms for linear programming
- The Cutting-Plane Method for Solving Convex Programs
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- On the Implementation of a Primal-Dual Interior Point Method
- Path-Following Methods for Linear Programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
This page was built for publication: Warm start of the primal-dual method applied in the cutting-plane scheme
