Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts

DOI10.1007/978-1-4614-0769-0_17zbMATH Open1334.90101OpenAlexW2127865202MaRDI QIDQ2802535FDOQ2802535

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

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

Mathematics Subject Classification ID

Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Cites Work

SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Title not available (Why is that?)
Title not available (Why is that?)
A new polynomial-time algorithm for linear programming
Lagrange Multipliers and Optimality
Title not available (Why is that?)
Modified barrier functions (theory and methods)
Warm start of the primal-dual method applied in the cutting-plane scheme
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
Warm-start strategies in interior-point methods for linear programming
Title not available (Why is that?)
On interior-point warmstarts for linear and combinatorial optimization
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
On constrained optimization by adjoint based quasi-Newton methods
Geometry of cuts and metrics
Handbook of semidefinite programming. Theory, algorithms, and applications
Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
Reoptimization With the Primal-Dual Interior Point Method
Cone-LP's and semidefinite programs: geometry and a simplex-type method
On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
On free variables in interior point methods
The integration of an interior-point cutting plane method within a branch-and-price algorithm
On the exact solution of a facility layout problem
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
An Exact Approach to the One-Dimensional Facility Layout Problem
Provably near-optimal solutions for very large single-row facility layout problems
One-Dimensional Space Allocation: An Ordering Algorithm
Efficient models for the facility layout problem
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
The interior-point revolution in optimization: History, recent developments, and lasting consequences
Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
Solving combinatorial optimization problems using Karmarkar's algorithm
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
Computational Experience with an Interior Point Cutting Plane Algorithm
The cut polytope and the Boolean quadric polytope
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
Some Network Flow Problems Solved with Pseudo-Boolean Programming
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Polynomial Interior Point Cutting Plane Methods
Experiments in quadratic 0-1 programming
A unifying framework for several cutting plane methods for semidefinite programming
Interior-point methods for optimization
First- and second-order methods for semidefinite programming
The Analytic Center Cutting Plane Method with Semidefinite Cuts
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
Title not available (Why is that?)
A Multiple-Cut 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
A second-order cone cutting surface method: Complexity and application
Title not available (Why is that?)
An analytic center cutting plane approach for conic programming
Title not available (Why is that?)
A conversion of an SDP having free variables into the standard form SDP

Cited In (10)

On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
An improved interior-point cutting-plane method for binary quadratic optimization
Warm start of the primal-dual method applied in the cutting-plane scheme
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
Warmstarting for interior point methods applied to the long-term power planning problem
An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis

Uses Software

SDPT3

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)