Pages that link to "Item:Q2349118"

The following pages link to A gentle, geometric introduction to copositive optimization (Q2349118):

Displaying 22 items.

• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• Quadratic programs with hollows (Q1659682) (← links)
• A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (Q1753067) (← links)
• A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
• Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
• On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
• An exact completely positive programming formulation for the discrete ordered median problem: an extended version (Q2176282) (← links)
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
• Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
• Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
• Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
• Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
• Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
• Performance comparison of two recently proposed copositivity tests (Q6114943) (← links)
• Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)