Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
From MaRDI portal
Publication:2802535
DOI10.1007/978-1-4614-0769-0_17zbMath1334.90101OpenAlexW2127865202MaRDI QIDQ2802535
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_17
Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (4)
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization 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 ⋮ An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Efficient models for the facility layout problem
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- A second-order cone cutting surface method: Complexity and application
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Experiments in quadratic 0-1 programming
- Modified barrier functions (theory and methods)
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Warm start of the primal-dual method applied in the cutting-plane scheme
- First- and second-order methods for semidefinite programming
- The cut polytope and the Boolean quadric polytope
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- 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
- On the exact solution of a facility layout problem
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- A conversion of an SDP having free variables into the standard form SDP
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- On Interior-Point Warmstarts for Linear and Combinatorial Optimization
- Lagrange Multipliers and Optimality
- An Analytic Center Cutting Plane Approach for Conic Programming
- A unifying framework for several cutting plane methods for semidefinite programming
- An Exact Approach to the One-Dimensional Facility Layout Problem
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- Provably near-optimal solutions for very large single-row facility layout problems
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
- Interior-point methods for optimization
- Deux problèmes d'affectation non linéaires
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- On free variables in interior point methods
- On constrained optimization by adjoint based quasi-Newton methods
- Reoptimization With the Primal-Dual Interior Point Method
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Cone-LP's and semidefinite programs: Geometry and a simplex-type method
- Polynomial Interior Point Cutting Plane Methods
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
- Geometry of cuts and metrics
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
