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

Cited In (only showing first 100 items - show all)

Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
Characterizing existence of minimizers and optimality to nonconvex quadratic integrals
Two methods for the maximization of homogeneous polynomials over the simplex
The fundamental theorem of linear programming: extensions and applications
A note on completely positive relaxations of quadratic problems in a multiobjective framework
Exploiting partial correlations in distributionally robust optimization
On sparsity of the solution to a random quadratic optimization problem
Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
Improved Conic Reformulations for $K$-means Clustering
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
On LP-based approximation for copositive formulation of stable set problem
Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
A new certificate for copositivity
Sum-of-squares certificates for copositivity via test states
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
On monotonicity and search strategies in face-based copositivity detection algorithms
Copositive tensor optimization problem and its applications to hypergraphs
LP-based tractable subcones of the semidefinite plus nonnegative cone
Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
Dense neighborhoods on affinity graph
Approximating the existential theory of the reals
Optimization over structured subsets of positive semidefinite matrices via column generation
Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior
Improved approximation results on standard quartic polynomial optimization
A MAX-CUT formulation of 0/1 programs
Tightening a copositive relaxation for standard quadratic optimization problems
Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
Optimization under uncertainty and risk: quadratic and copositive approaches
Complexity results for some global optimization problems
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
(Global) optimization: historical notes and recent developments
Performance comparison of two recently proposed copositivity tests
Generating extreme copositive matrices near matrices obtained from COP-irreducible graphs
Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
Approximating the existential theory of the reals
A study on sequential minimal optimization methods for standard quadratic problems
Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
Approximation algorithm for a class of global optimization problems
Copositive Programming
Two-stage stochastic standard quadratic optimization
On the accuracy of uniform polyhedral approximations of the copositive cone
Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
Constructing patterns of (many) ESSs under support size control
Testing copositivity via mixed-integer linear programming
A PTAS for the minimization of polynomials of fixed degree over the simplex
Rounding on the standard simplex: regular grids for global optimization
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
Separable standard quadratic optimization problems
New bounds for nonconvex quadratically constrained quadratic programming
On conic QPCCs, conic QCQPs and completely positive programs
Interplay of non-convex quadratically constrained problems with adjustable robust optimization
Exploiting equalities in polynomial programming
On standard quadratic programs with exact and inexact doubly nonnegative relaxations
Optimizing a polyhedral-semidefinite relaxation of completely positive programs
An improved algorithm to test copositivity
Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph
Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
Exceptional family and solvability of copositive complementarity problems
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
Distributionally robust mixed integer linear programs: persistency models with applications
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
A linear programming reformulation of the standard quadratic optimization problem
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Copositive optimization -- recent developments and applications
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
Searching for critical angles in a convex cone
Computing the distance between the linear matrix pencil and the completely positive cone
Copositive programming motivated bounds on the stability and the chromatic numbers
A new branch-and-bound algorithm for standard quadratic programming problems
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
Representing quadratically constrained quadratic programs as generalized copositive programs
Semidefinite programming relaxations for graph coloring and maximal clique problems
Interiors of completely positive cones
Copositivity and constrained fractional quadratic problems
On the copositive representation of binary and continuous nonconvex quadratic programs
D.C. versus copositive bounds for standard QP
On copositive programming and standard quadratic optimization problems
Separating doubly nonnegative and completely positive matrices
The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
A clique algorithm for standard quadratic programming
Well supported approximate equilibria in bimatrix games
Scaling relationship between the copositive cone and Parrilo's first level approximation
Completely positive reformulations for polynomial optimization
Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
Factorization and cutting planes for completely positive matrices by copositive projection
Improved SDP bounds for minimizing quadratic functions over the $\ell^{1}$-ball
The cubic spherical optimization problems
Foundations of Set-Semidefinite Optimization

Uses Software

SeDuMi

This page was built for publication: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812072)