Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
From MaRDI portal
Publication:2391873
DOI10.1007/s00186-013-0431-zzbMath1272.90045OpenAlexW2019780010MaRDI QIDQ2391873
Alexander Engau, Miguel F. Anjos, Immanuel M. Bomze
Publication date: 5 August 2013
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-013-0431-z
interior-point algorithmssemidefinite programmingcombinatorial optimizationstable setmaximum cliquecutting-plane methodstheta number
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Applications of mathematical programming (90C90) Quadratic programming (90C20) Interior-point methods (90C51) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (4)
SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- On the stable solution of large scale problems over the doubly nonnegative cone
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Adaptive constraint reduction for convex quadratic programming
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Copositivity cuts for improving SDP bounds on the clique number
- Approximation of the Stability Number of a Graph via Copositive Programming
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- Computational Approaches to Max-Cut
- An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- Matrix Relaxations in Combinatorial Optimization
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- On Interior-Point Warmstarts for Linear and Combinatorial Optimization
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- The Operator $\Psi$ for the Chromatic Number of a Graph
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- A comparison of the Delsarte and Lovász bounds
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- Computational Experience with Stable Set Relaxations
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Benchmarking optimization software with performance profiles.
This page was built for publication: Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
