An efficient splitting algorithm for solving the CDT subproblem
From MaRDI portal
Publication:6561567
Recommendations
- Solving generalized CDT problems via two-parameter eigenvalues
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Subspace choices for the Celis-Dennis-Tapia problem
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
Cites work
- scientific article; zbMATH DE number 3903874 (Why is no real title available?)
- scientific article; zbMATH DE number 2218045 (Why is no real title available?)
- A hybrid algorithm for the two-trust-region subproblem
- A note on polynomial solvability of the CDT problem
- A two-variable approach to the two-trust-region subproblem
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Consensus-ADMM for General Quadratically Constrained Quadratic Programming
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- New Results on Quadratic Minimization
- New results on narrowing the duality gap of the extended Celis-Dennis-Tapia problem
- On a subproblem of trust region algorithms for constrained optimization
- On globally solving the extended trust-region subproblems
- On maxima of dual function of the CDT subproblem
- On the complexity of quadratic programming with two quadratic constraints
- Quadratic optimization with two ball constraints
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Solving generalized CDT problems via two-parameter eigenvalues
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
This page was built for publication: An efficient splitting algorithm for solving the CDT subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561567)
