Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
From MaRDI portal
Publication:1029621
DOI10.1007/s10589-007-9096-yzbMath1168.90554OpenAlexW2091010238MaRDI QIDQ1029621
E. Alper Yıldırım, Elizabeth John
Publication date: 13 July 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22978
Related Items
A fast first-order optimization approach to elastoplastic analysis of skeletal structures, 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, Initial guess sensitivity in computational optimal control problems, 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?, Towards an efficient augmented Lagrangian method for convex quadratic programming, 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, A new warmstarting strategy for the primal-dual column generation method, Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion, A warm-start approach for large-scale stochastic linear programs, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, Large scale model predictive control with neural networks and primal active sets, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- Modified barrier functions (theory and methods)
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs
- Multiple centrality corrections in a primal-dual method for linear programming
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Presolving in linear programming
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- A Mathematical View of Interior-Point Methods in Convex Optimization
- An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- On Warm Starts for Interior Methods
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- On the Implementation of a Primal-Dual Interior Point Method
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- On constrained optimization by adjoint based quasi-Newton methods
- Reoptimization With the Primal-Dual Interior Point Method
- PCx: an interior-point code for linear programming
- Computational Experience with an Interior Point Cutting Plane Algorithm
- An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
- On the Automatic Scaling of Matrices for Gaussian Elimination
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
