Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924)

scientific article; zbMATH DE number 7711241

Language	Label	Description	Also known as
English	Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems	scientific article; zbMATH DE number 7711241

Statements

instance of

scholarly article

0 references

title

Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (English)

0 references

0 references

0 references

EURO Journal on Computational Optimization

0 references

publication date

12 July 2023

0 references

zbMATH Keywords

semidefinite programming

0 references

second order cone programming

0 references

copositive optimization

0 references

binary quadratic optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejco.2021.100021

0 references

cites work

The extreme rays of the $6\times 6$ copositive cone

0 references

DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization

0 references

Second-order cone programming

0 references

Optimality conditions and global convergence for nonlinear semidefinite programming

0 references

A note on the Lasserre hierarchy for different formulations of the maximum independent set problem

0 references

Handbook on semidefinite, conic and polynomial optimization

0 references

A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming

0 references

Cuts for Conic Mixed-Integer Programming

0 references

On conic QPCCs, conic QCQPs and completely positive programs

0 references

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

0 references

Q3182207

0 references

Lectures on Modern Convex Optimization

0 references

Open problems in the theory of completely positive and copositive matrices

0 references

Q4405832

0 references

A deterministic approximation algorithm for the densest $k$-subgraph problem

0 references

Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems

0 references

A fresh CP look at mixed-binary QPs: new formulations and relaxations

0 references

Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming

0 references

On copositive programming and standard quadratic optimization problems

0 references

A note on Burer's copositive representation of mixed-binary QPs

0 references

Q3916398

0 references

Regularizing the abstract convex program

0 references

On the separation of split inequalities for non-convex quadratic integer programming

0 references

An Adaptive Linear Approximation Algorithm for Copositive Programs

0 references

On the copositive representation of binary and continuous nonconvex quadratic programs

0 references

Optimizing a polyhedral-semidefinite relaxation of completely positive programs

0 references

Copositive Programming

0 references

Representing quadratically constrained quadratic programs as generalized copositive programs

0 references

Unbounded convex sets for non-convex mixed-integer quadratic programming

0 references

A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation

0 references

A Greedy Heuristic for the Set-Covering Problem

0 references

Geometry of the copositive and completely positive cones

0 references

Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets''

0 references

On the computational complexity of membership problems for the completely positive cone and its dual

0 references

A copositive formulation for the stability number of infinite graphs

0 references

Exploiting symmetry in copositive programs via semidefinite hierarchies

0 references

Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone

0 references

Symmetry-exploiting cuts for a class of mixed-$0/1$ second-order cone programs

0 references

Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming

0 references

Genericity Results in Linear Conic Programming—A Tour d’Horizon

0 references

Q5503714

0 references

On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets

0 references

Approximation of the quadratic set covering problem

0 references

Several Jordan-algebraic aspects of optimization†

0 references

A framework for solving mixed-integer semidefinite programs

0 references

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

0 references

Second-order cone optimization formulations for service system design problems with congestion

0 references

Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices

0 references

The Operator $\Psi$ for the Chromatic Number of a Graph

0 references

Clique is hard to approximate within $n^{1-\epsilon}$

0 references

Semidefinite programming

0 references

The spectral bundle method with second-order information

0 references

A Spectral Bundle Method for Semidefinite Programming

0 references

Approximation Algorithms for the Set Covering and Vertex Cover Problems

0 references

On Solving the Quadratic Shortest Path Problem

0 references

Burer's key assumption for semidefinite and doubly nonnegative relaxations

0 references

Exploiting special structure in semidefinite programming: a survey of theory and applications

0 references

Approximation of the Stability Number of a Graph via Copositive Programming

0 references

Initialization in semidefinite programming via a self-dual skew-symmetric embedding

0 references

A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems

0 references

PENNON: Software for Linear and Nonlinear Matrix Inequalities

0 references

Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization

0 references

Approximating the cone of copositive kernels to estimate the stability number of infinite graphs

0 references

Q3395491

0 references

New approximations for the cone of copositive matrices and its dual

0 references

A MAX-CUT formulation of 0/1 programs

0 references

Q3601990

0 references

Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone

0 references

Graph partitioning using linear and semidefinite programming

0 references

Applications of second-order cone programming

0 references

On the Shannon capacity of a graph

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

On the hardness of approximating minimization problems

0 references

Solving $k$-cluster problems to optimality with semidefinite programming

0 references

On the Matrix Equation X′X = A

0 references

Maxima for Graphs and a New Proof of a Theorem of Turán

0 references

Some NP-complete problems in quadratic and nonlinear programming

0 references

Q4324980

0 references

ADMM for the SDP relaxation of the QAP

0 references

Q4321546

0 references

Quadratic programming with one negative eigenvalue is NP-hard

0 references

Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals

0 references

Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs

0 references

Computing the Stability Number of a Graph Via Linear and Semidefinite Programming

0 references

Completely positive reformulations for polynomial optimization

0 references

Copositive and semidefinite relaxations of the quadratic assignment problem

0 references

Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints

0 references

Copositive realxation for genera quadratic programming

0 references

An exact duality theory for semidefinite programming and its complexity implications

0 references

A Mathematical View of Interior-Point Methods in Convex Optimization

0 references

A comparison of the Delsarte and Lovász bounds

0 references

Q3802887

0 references

Semidefinite Programming

0 references

Polyhedral approximations inp-order cone programming

0 references

Alternating direction augmented Lagrangian methods for semidefinite programming

0 references

Completely positive reformulations of polynomial optimization problems with linear constraints

0 references

A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

A survey of adjustable robust optimization

0 references

On the accuracy of uniform polyhedral approximations of the copositive cone

0 references

Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis

0 references

Scalable Semidefinite Programming

0 references

Identifiers

zbMATH Open document ID

1516.90043

0 references

DOI

10.1016/j.ejco.2021.100021

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6114924