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

DOI10.1023/A:1020209017701zbMATH Open1047.90038OpenAlexW1518832340MaRDI QIDQ1812072FDOQ1812072

Authors: Immanuel M. Bomze, E. 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

Recommendations

• On copositive programming and standard quadratic optimization problems
• A linear programming reformulation of the standard quadratic optimization problem
• On the accuracy of uniform polyhedral approximations of the copositive cone
• An adaptive linear approximation algorithm for copositive programs
• Analysis of copositive optimization based linear programming bounds on standard quadratic optimization

zbMATH Keywords

Linear matrix inequalitiesApproximation algorithmsSemidefinite programmingStandard quadratic optimizationStability numberCopositive cone

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Semidefinite programming (90C22)

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

• 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
• Foundations of set-semidefinite optimization
• Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
• 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
• On Polyhedral Approximations of the Second-Order Cone
• 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
• Separable standard quadratic optimization problems
• An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution
• 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
• 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
• 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
• An adaptive linear approximation algorithm for copositive programs
• Robust quadratic programming with mixed-integer uncertainty
• 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
• DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
• 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
• Copositivity-based approximations for mixed-integer fractional quadratic optimization
• On copositive programming and standard quadratic optimization problems
• Separating doubly nonnegative and completely positive matrices
• Approximating non-convex quadratic programs by semidefinite and copositive programming
• 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
• A refined error analysis for fixed-degree polynomial optimization over the simplex
• Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
• Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
• Copositivity aspects of standard quadratic optimization problems
• A note on set-semidefinite relaxations of nonconvex quadratic programs
• Copositive programming
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• On the complexity of optimization over the standard simplex
• New approximations for the cone of copositive matrices and its dual
• Sparse solutions to random standard quadratic optimization problems
• A gentle, geometric introduction to copositive optimization
• Mathematical optimization ideas for biodiversity conservation
• On the convergence rate of grid search for polynomial optimization over the simplex
• Copositive programming by simplicial partition
• Computable representations for convex hulls of low-dimensional quadratic forms
• Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
• Constructing patterns of (many) ESSs under support size control
• Characterizing existence of minimizers and optimality to nonconvex quadratic integrals
• Approximation of copositive programming via linear programming using second order sum of square decomposition
• 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
• Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization
• The complexity of simple models -- a study of worst and typical hard cases for the standard quadratic optimization problem
• Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
• On LP-based approximation for copositive formulation of stable set problem
• 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

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)