On copositive programming and standard quadratic optimization problems
From MaRDI portal
Publication:5929997
DOI10.1023/A:1026583532263zbMath0970.90057OpenAlexW1549791526MaRDI QIDQ5929997
Etienne de Klerk, Cornelis Roos, Mirjam Dür, Arie J. Quist, Immanuel M. Bomze, Tamás Terlaky
Publication date: 17 April 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026583532263
Related Items
On standard quadratic programs with exact and inexact doubly nonnegative relaxations, Matrix Relaxations in Combinatorial Optimization, 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, On strong duality in linear copositive programming, Fast Cluster Detection in Networks by First Order Optimization, On the copositive representation of binary and continuous nonconvex quadratic programs, On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, A copositive formulation for the stability number of infinite graphs, LP-based tractable subcones of the semidefinite plus nonnegative cone, On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets, Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression, A factorization method for completely positive matrices, Generating irreducible copositive matrices using the stable set problem, Sparse solutions to random standard quadratic optimization problems, Semidefinite approximations for quadratic programs over orthogonal matrices, A note on set-semidefinite relaxations of nonconvex quadratic programs, A primal barrier function phase I algorithm for nonsymmetric conic optimization problems, Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets, A fresh CP look at mixed-binary QPs: new formulations and relaxations, Completely positive factorization by a Riemannian smoothing method, Partially positive matrices, Copositivity and constrained fractional quadratic problems, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, A Sum of Squares Characterization of Perfect Graphs, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty, Optimization under uncertainty and risk: quadratic and copositive approaches, Interiors of completely positive cones, (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, Approximation hierarchies for copositive cone over symmetric cone and their comparison, A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems, Hermitian completely positive matrices, Copositive optimization -- recent developments and applications, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Optimality theorems for convex semidefinite vector optimization problems, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, An improved algorithm to test copositivity, An algorithm for determining copositive matrices, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Conic formulation of QPCCs applied to truly sparse QPs, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, Exceptional family and solvability of copositive complementarity problems, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Solving Quadratic Programming by Cutting Planes, A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem, Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, Analysis of copositive optimization based linear programming bounds on standard quadratic optimization, Completely positive and copositive program modelling for quadratic optimization problems, 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, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, A clique algorithm for standard quadratic programming, Algorithmic copositivity detection by simplicial partition, Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems, Quadratic factorization heuristics for copositive programming, Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, Foundations of Set-Semidefinite Optimization, Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, The CP-Matrix Approximation Problem, Copositive Programming, Optimality conditions for linear copositive programming problems with isolated immobile indices, A modified simplex partition algorithm to test copositivity, On the computation of \(C^*\) certificates, Two-stage stochastic standard quadratic optimization, Continuous cubic formulations for cluster detection problems in networks, D.C. versus copositive bounds for standard QP, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem, Completely positive reformulations for polynomial optimization, On Degenerate Doubly Nonnegative Projection Problems
