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