Pages that link to "Item:Q312665"

The following pages link to On conic QPCCs, conic QCQPs and completely positive programs (Q312665):

Displaying 23 items.

• Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
• Applying ranking and selection procedures to long-term mitigation for improved network restoration (Q339947) (← links)
• A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
• Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
• Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
• An exact completely positive programming formulation for the discrete ordered median problem: an extended version (Q2176282) (← links)
• Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
• Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
• On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
• Completely positive and copositive program modelling for quadratic optimization problems (Q5151542) (← links)
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
• Approximation hierarchies for copositive cone over symmetric cone and their comparison (Q6122328) (← links)
• Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
• Generalizations of doubly nonnegative cones and their comparison (Q6619737) (← links)