On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494): Difference between revisions

Latest revision as of 06:56, 5 July 2024

scientific article

Language	Label	Description	Also known as
English	On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems	scientific article

Statements

instance of

scholarly article

0 references

title

On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (English)

0 references

0 references

0 references

0 references

Optimization Methods and Software

0 references

publication date

23 May 2012

0 references

zbMATH Keywords

cutting-plane methods

0 references

warm starts

0 references

maximum-cut

0 references

facility layout

0 references

describes a project that uses

Biq Mac

0 references

SDPT3

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/10556788.2010.544308

0 references

cites work

A new lower bound for the single row facility layout problem

0 references

On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization

0 references

A semidefinite optimization approach for the single-row layout problem with unequal dimensions

0 references

Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes

0 references

Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem

0 references

Provably near-optimal solutions for very large single-row facility layout problems

0 references

Efficient approximation and online algorithms. Recent progress on classical combinatorial optimization problems and new applications

0 references

An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming

0 references

On Semidefinite Programming Relaxations of the Traveling Salesman Problem

0 references

Geometry of cuts and metrics

0 references

A Study of Indicators for Identifying Zero Variables in Interior-Point Methods

0 references

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

0 references

An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization

0 references

On Interior-Point Warmstarts for Linear and Combinatorial Optimization

0 references

On the Identification of Zero Variables in an Interior-Point Framework

0 references

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition

0 references

A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start''

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Warm start of the primal-dual method applied in the cutting-plane scheme

0 references

Reoptimization With the Primal-Dual Interior Point Method

0 references

Q5465120

0 references

Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

0 references

A Spectral Bundle Method for Semidefinite Programming

0 references

A unifying framework for several cutting plane methods for semidefinite programming

0 references

Q4668573

0 references

Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art

0 references

An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers

0 references

Computational Experience with an Interior Point Cutting Plane Algorithm

0 references

Solving real-world linear ordering problems using a primal-dual interior point cutting plane method

0 references

Polynomiality of infeasible-interior-point algorithms for linear programming

0 references

First- and second-order methods for semidefinite programming

0 references

Active Set Identification in Nonlinear Programming

0 references

Modified barrier functions (theory and methods)

0 references

Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

0 references

One-Dimensional Space Allocation: An Ordering Algorithm

0 references

A new heuristic for the linear placement problem

0 references

A study of search directions in primal-dual interior-point methods for semidefinite programming

0 references

Solving semidefinite-quadratic-linear programs using SDPT3

0 references

Warm-Start Strategies in Interior-Point Methods for Linear Programming

0 references

Identifiers

zbMATH Open document ID

1242.90193

0 references

DOI

10.1080/10556788.2010.544308

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2885494

@@ Property / cites work @@
+A new lower bound for the single row facility layout problem
+Normal rank
@@ Property / cites work @@
+On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
+Normal rank
@@ Property / cites work @@
+A semidefinite optimization approach for the single-row layout problem with unequal dimensions
+Normal rank
@@ Property / cites work @@
+Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
+Normal rank
@@ Property / cites work @@
+Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
+Normal rank
@@ Property / cites work @@
+Provably near-optimal solutions for very large single-row facility layout problems
+Normal rank
@@ Property / cites work @@
+Efficient approximation and online algorithms. Recent progress on classical combinatorial optimization problems and new applications
+Normal rank
@@ Property / cites work @@
+An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
+Normal rank
@@ Property / cites work @@
+On Semidefinite Programming Relaxations of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Geometry of cuts and metrics
@@ Property / cites work: Geometry of cuts and metrics / rank @@
+Normal rank
@@ Property / cites work @@
+A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
+Normal rank
@@ Property / cites work @@
+Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
+Normal rank
@@ Property / cites work @@
+An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization
+Normal rank
@@ Property / cites work @@
+On Interior-Point Warmstarts for Linear and Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+On the Identification of Zero Variables in an Interior-Point Framework
+Normal rank
@@ Property / cites work @@
+Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
+Normal rank
@@ Property / cites work @@
+A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start''
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Warm start of the primal-dual method applied in the cutting-plane scheme
+Normal rank
@@ Property / cites work @@
+Reoptimization With the Primal-Dual Interior Point Method
+Normal rank
@@ Property / cites work @@
+Q5465120
@@ Property / cites work: Q5465120 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
+Normal rank
@@ Property / cites work @@
+A Spectral Bundle Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+A unifying framework for several cutting plane methods for semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q4668573
@@ Property / cites work: Q4668573 / rank @@
+Normal rank
@@ Property / cites work @@
+Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
+Normal rank
@@ Property / cites work @@
+An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers
+Normal rank
@@ Property / cites work @@
+Computational Experience with an Interior Point Cutting Plane Algorithm
+Normal rank
@@ Property / cites work @@
+Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
+Normal rank
@@ Property / cites work @@
+Polynomiality of infeasible-interior-point algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+First- and second-order methods for semidefinite programming
+Normal rank
@@ Property / cites work @@
+Active Set Identification in Nonlinear Programming
+Normal rank
@@ Property / cites work @@
+Modified barrier functions (theory and methods)
@@ Property / cites work: Modified barrier functions (theory and methods) / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
+Normal rank
@@ Property / cites work @@
+One-Dimensional Space Allocation: An Ordering Algorithm
+Normal rank
@@ Property / cites work @@
+A new heuristic for the linear placement problem
@@ Property / cites work: A new heuristic for the linear placement problem / rank @@
+Normal rank
@@ Property / cites work @@
+A study of search directions in primal-dual interior-point methods for semidefinite programming
+Normal rank
@@ Property / cites work @@
+Solving semidefinite-quadratic-linear programs using SDPT3
+Normal rank
@@ Property / cites work @@
+Warm-Start Strategies in Interior-Point Methods for Linear Programming
+Normal rank