Pages that link to "Item:Q2349132"
From MaRDI portal
The following pages link to Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132):
Displaying 28 items.
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- Tilt stability for quadratic programs with one or two quadratic inequality constraints (Q778159) (← links)
- Quadratic optimization with two ball constraints (Q779620) (← links)
- On KKT points of Celis-Dennis-Tapia subproblem (Q862712) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- Subspace choices for the Celis-Dennis-Tapia problem (Q1701260) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
- On maxima of dual function of the CDT subproblem (Q2725276) (← links)
- A note on polynomial solvability of the CDT problem (Q2789609) (← links)
- A two-variable approach to the two-trust-region subproblem (Q2796795) (← links)
- Copositivity for second-order optimality conditions in general smooth optimization problems (Q2810093) (← links)
- Solving generalized CDT problems via two-parameter eigenvalues (Q2817837) (← links)
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem (Q2968177) (← links)
- Computing the Signed Distance Between Overlapping Ellipsoids (Q3454510) (← links)
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)
- Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem (Q5116545) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
- New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem (Q5737733) (← links)
- An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints (Q5857291) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem (Q6161303) (← links)
- An efficient splitting algorithm for solving the CDT subproblem (Q6561567) (← links)
- Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching (Q6596338) (← links)
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem (Q6617001) (← links)
