Pages that link to "Item:Q2789609"
From MaRDI portal
The following pages link to A Note on Polynomial Solvability of the CDT Problem (Q2789609):
Displaying 35 items.
- 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)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- When a system of real quadratic equations has a solution (Q2143674) (← links)
- Comment on: ``Approximation algorithms for quadratic programming'' (Q2165269) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← 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)
- A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
- A Two-Variable Approach to the Two-Trust-Region Subproblem (Q2796795) (← 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)
- The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction (Q4638912) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
- On Chebyshev Center of the Intersection of Two Ellipsoids (Q5214416) (← links)
- A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere (Q5231687) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
- New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem (Q5737733) (← links)
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints (Q5883323) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
- A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints (Q6093405) (← 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)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← 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)
