Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
From MaRDI portal
Publication:2802535
Recommendations
- Recent developments in interior-point methods
- Some recent advances and new directions in interior point methods for linear programming
- On interior-point warmstarts for linear and combinatorial optimization
- Warm-start strategies in interior-point methods for linear programming
- scientific article; zbMATH DE number 1489809
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Interior-point algorithms: creation history, research results, applications, and prospects
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Interior-point methods for linear programming: a review
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1489805 (Why is no real title available?)
- scientific article; zbMATH DE number 1534294 (Why is no real title available?)
- scientific article; zbMATH DE number 1534295 (Why is no real title available?)
- scientific article; zbMATH DE number 1534296 (Why is no real title available?)
- scientific article; zbMATH DE number 1534297 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2196287 (Why is no real title available?)
- scientific article; zbMATH DE number 2246591 (Why is no real title available?)
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- A conversion of an SDP having free variables into the standard form SDP
- A new polynomial-time algorithm for linear programming
- A second-order cone cutting surface method: Complexity and application
- A unifying framework for several cutting plane methods for semidefinite programming
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- An Exact Approach to the One-Dimensional Facility Layout Problem
- An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
- An analytic center cutting plane approach for conic programming
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- Deux problèmes d'affectation non linéaires
- Efficient models for the facility layout problem
- Experiments in quadratic 0-1 programming
- First- and second-order methods for semidefinite programming
- Geometry of cuts and metrics
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-point methods for optimization
- Lagrange Multipliers and Optimality
- Modified barrier functions (theory and methods)
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- On constrained optimization by adjoint based quasi-Newton methods
- On free variables in interior point methods
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- On interior-point warmstarts for linear and combinatorial optimization
- On the exact solution of a facility layout problem
- One-Dimensional Space Allocation: An Ordering Algorithm
- Polynomial Interior Point Cutting Plane Methods
- Provably near-optimal solutions for very large single-row facility layout problems
- Reoptimization With the Primal-Dual Interior Point Method
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- The cut polytope and the Boolean quadric polytope
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Warm-start strategies in interior-point methods for linear programming
Cited in
(10)- An improved interior-point cutting-plane method for binary quadratic optimization
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Warmstarting for interior point methods applied to the long-term power planning problem
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
This page was built for publication: Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802535)
