Pages that link to "Item:Q380506"
From MaRDI portal
The following pages link to Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming (Q380506):
Displaying 13 items.
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← links)
- A new conic approach to semisupervised support vector machines (Q1793456) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability (Q2022366) (← links)
- An efficient cutting plane algorithm for the smallest enclosing circle problem (Q2358480) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems (Q2438409) (← links)
- Quadratic optimization over one first-order cone (Q2438413) (← links)
- Quadratic optimization over a polyhedral cone (Q2515280) (← links)
- Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming (Q5408222) (← links)
