Warm start of the primal-dual method applied in the cutting-plane scheme
From MaRDI portal
Publication:1290656
DOI10.1007/BF02680554zbMATH Open0920.90102MaRDI QIDQ1290656FDOQ1290656
Authors: Jacek Gondzio 
Publication date: 15 September 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- A new warmstarting strategy for the primal-dual column generation method
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- Warm-start strategies in interior-point methods for linear programming
- Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- On interior-point warmstarts for linear and combinatorial optimization
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
- Warm-start cuts for generalized Benders decomposition.
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- The Cutting-Plane Method for Solving Convex Programs
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Multiple centrality corrections in a primal-dual method for linear programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Title not available (Why is that?)
- Path-Following Methods for Linear Programming
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Primal-dual target-following algorithms for linear programming
- On the augmented system approach to sparse least-squares problems
- A weighted least squares study of robustness in interior point linear programming
- Cutting planes and column generation techniques with the projective algorithm
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
- Title not available (Why is that?)
Cited In (30)
- A framework for solving mixed-integer semidefinite programs
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- Active-set prediction for interior point methods using controlled perturbations
- Large-scale optimization with the primal-dual column generation method
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Adding activities to the dual instead of cuts to the primal problem
- A non-interior implicit smoothing approach to complementarity problems for frictionless contacts
- 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
- Constraint programming approaches to disassembly line balancing problem with sequencing decisions
- Could we use a million cores to solve an integer program?
- A warm-start approach for large-scale stochastic linear programs
- Warm start by Hopfield neural networks for interior point methods
- On warm starts for interior methods
- A specialized primal-dual interior point method for the plastic truss layout optimization
- A heuristic for the long-term electricity generation planning problem using the Bloom and Gallant formulation
- Warmstarting for interior point methods applied to the long-term power planning problem
- Interior Point Methods for Nonlinear Optimization
- An interior point cutting plane heuristic for mixed integer programming
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Multiplicative update rules for incremental training of multiclass support vector machines
- Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion
- SICOpt: Solution approach for nonlinear integer stochastic programming problems
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
Uses Software
This page was built for publication: Warm start of the primal-dual method applied in the cutting-plane scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290656)
