Pages that link to "Item:Q360523"
From MaRDI portal
The following pages link to Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets'' (Q360523):
Displaying 11 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
