Pages that link to "Item:Q5704124"
From MaRDI portal
The following pages link to On Cones of Nonnegative Quadratic Functions (Q5704124):
Displaying 50 items.
- S-lemma with equality and its applications (Q263215) (← links)
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure (Q274079) (← links)
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- A linear-time algorithm for trust region problems (Q304248) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere (Q341317) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization (Q374638) (← links)
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
- On the indefinite quadratic fractional optimization with two quadratic constraints (Q467422) (← links)
- Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- New results on Hermitian matrix rank-one decomposition (Q543410) (← links)
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Alternating direction method for bi-quadratic programming (Q652699) (← links)
- Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint (Q693140) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- Quadratic optimization with two ball constraints (Q779620) (← links)
- On box-constrained total least squares problem (Q827567) (← links)
- Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← links)
- A \({\mathsf{D}}\)-induced duality and its applications (Q925269) (← links)
- Robust portfolio selection based on a multi-stage scenario tree (Q932207) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Exactness of sums of squares relaxations involving \(3\times 3\) matrices and Lorentz cones (Q996334) (← links)
- Positivity of Riesz functionals and solutions of quadratic and quartic moment problems (Q1048166) (← links)
- Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices (Q1646573) (← links)
- A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality (Q1655381) (← links)
- An efficient algorithm for solving the generalized trust region subproblem (Q1655384) (← links)
- Quadratic programs with hollows (Q1659682) (← links)
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
- Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem (Q1686558) (← links)
- Subspace choices for the Celis-Dennis-Tapia problem (Q1701260) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Theorems of the alternative for inequality systems of real polynomials (Q1762405) (← links)
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
- Some results for quadratic problems with one or two quadratic constraints (Q1785624) (← links)
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
- On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)
- A new conic approach to semisupervised support vector machines (Q1793456) (← links)
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
- An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients (Q1993432) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
