On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
From MaRDI portal
Publication:2885494
Recommendations
- An improved interior-point cutting-plane method for binary quadratic optimization
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- scientific article; zbMATH DE number 1182577
- scientific article; zbMATH DE number 2196287
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
Cites work
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- scientific article; zbMATH DE number 2196287 (Why is no real title available?)
- A Spectral Bundle Method for Semidefinite Programming
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- A new heuristic for the linear placement problem
- A new lower bound for the single row facility layout problem
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- A unifying framework for several cutting plane methods for semidefinite programming
- Active Set Identification in Nonlinear Programming
- An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- An improved interior-point cutting-plane method for binary quadratic optimization
- 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
- Efficient approximation and online algorithms. Recent progress on classical combinatorial optimization problems and new applications
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- First- and second-order methods for semidefinite programming
- Geometry of cuts and metrics
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Modified barrier functions (theory and methods)
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- On interior-point warmstarts for linear and combinatorial optimization
- On the Identification of Zero Variables in an Interior-Point Framework
- One-Dimensional Space Allocation: An Ordering Algorithm
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Provably near-optimal solutions for very large single-row facility layout problems
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- Reoptimization With the Primal-Dual Interior Point Method
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- 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
- Solving semidefinite-quadratic-linear programs using SDPT3
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- 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)- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Conic approximation to quadratic optimization with linear complementarity constraints
- An improved interior-point cutting-plane method for binary quadratic optimization
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Single row layout models
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
This page was built for publication: On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885494)
