Pages that link to "Item:Q2796795"
From MaRDI portal
The following pages link to A two-variable approach to the two-trust-region subproblem (Q2796795):
Displaying 22 items.
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← links)
- A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts (Q2628919) (← links)
- A note on polynomial solvability of the CDT problem (Q2789609) (← 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)
- The trust region subproblem and semidefinite programming* (Q4673323) (← links)
- On Chebyshev Center of the Intersection of Two Ellipsoids (Q5214416) (← links)
- New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem (Q5737733) (← links)
- A Linear-Time Algorithm for Generalized Trust Region Subproblems (Q5853724) (← links)
- An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints (Q5857291) (← links)
- KKT-based primal-dual exactness conditions for the Shor relaxation (Q6104908) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem (Q6161303) (← links)
- Semidefinite representable reformulations for two variants of the trust-region subproblem (Q6556206) (← 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)
