Pages that link to "Item:Q4441956"
From MaRDI portal
The following pages link to New Results on Quadratic Minimization (Q4441956):
Displayed 50 items.
- S-lemma with equality and its applications (Q263215) (← links)
- A linear-time algorithm for trust region problems (Q304248) (← links)
- Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- The generalized trust region subproblem (Q457202) (← links)
- Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← links)
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds (Q497446) (← links)
- New results on Hermitian matrix rank-one decomposition (Q543410) (← links)
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← 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)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint (Q693140) (← links)
- Tilt stability for quadratic programs with one or two quadratic inequality constraints (Q778159) (← links)
- On box-constrained total least squares problem (Q827567) (← links)
- Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← links)
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid (Q1016108) (← links)
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming (Q1035905) (← 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)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← 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)
- 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)
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty (Q1941033) (← links)
- An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients (Q1993432) (← links)
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
- Global optimality condition for quadratic optimization problems under data uncertainty (Q2045908) (← links)
- On the convexity for the range set of two quadratic functions (Q2076462) (← links)
- An efficient algorithm for the extended trust-region subproblem with two linear constraints (Q2119320) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- On the local stability of semidefinite relaxations (Q2144546) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- Globally solving extended trust region subproblems with two intersecting cuts (Q2228371) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint (Q2322558) (← links)
- A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
- Global optimality conditions for nonlinear programming problems with linear equality constraints (Q2336220) (← links)
- A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← links)