A gentle, geometric introduction to copositive optimization
From MaRDI portal
Publication:2349118
DOI10.1007/s10107-015-0888-zzbMath1327.90162OpenAlexW1972746552MaRDI QIDQ2349118
Publication date: 19 June 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0888-z
nonconvex optimizationsemidefinite optimizationcopositive optimizationvalid cutsglobal optimum of nonconvex optimization problems
Semidefinite programming (90C22) Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
On Convex Hulls of Epigraphs of QCQPs, On the tightness of SDP relaxations of QCQPs, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, On conic QPCCs, conic QCQPs and completely positive programs, On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations, Conic approximation to quadratic optimization with linear complementarity constraints, Quadratic programs with hollows, Cutting Plane Generation through Sparse Principal Component Analysis, Interplay of non-convex quadratically constrained problems with adjustable robust optimization, An exact completely positive programming formulation for the discrete ordered median problem: an extended version, A fresh CP look at mixed-binary QPs: new formulations and relaxations, A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants, Completely positive factorization by a Riemannian smoothing method, Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs, Optimization under uncertainty and risk: quadratic and copositive approaches, Performance comparison of two recently proposed copositivity tests, Convex hull results on quadratic programs with non-intersecting constraints, Conic formulation of QPCCs applied to truly sparse QPs, Testing copositivity via mixed-integer linear programming, Exploiting partial correlations in distributionally robust optimization, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, 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 copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides, Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches, Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality, A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming, Lifting convex inequalities for bipartite bilinear programs, On Chebyshev Center of the Intersection of Two Ellipsoids, Lifting convex inequalities for bipartite bilinear programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Geometric algorithms and combinatorial optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- The trust region subproblem with non-intersecting linear constraints
- Computable representations for convex hulls of low-dimensional quadratic forms
- A Note on Polynomial Solvability of the CDT Problem
- Copositive Programming
- A Variational Approach to Copositive Matrices
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- On the Matrix Equation X′X = A
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- New Results on Quadratic Minimization
- Trust Region Methods
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- On Cones of Nonnegative Quadratic Functions
