Pages that link to "Item:Q360522"
From MaRDI portal
The following pages link to On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522):
Displaying 20 items.
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets'' (Q360523) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
- Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← 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)
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems (Q2436648) (← links)
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
- On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier (Q2670452) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints (Q2903231) (← links)
- The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning (Q3177159) (← links)
- On equivalent representations and properties of faces of the cone of copositive matrices (Q5044098) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← 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)
- Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization (Q6166103) (← links)
- Semidefinite representable reformulations for two variants of the trust-region subproblem (Q6556206) (← links)
