On maxima of dual function of the CDT subproblem
From MaRDI portal
The authors present an approximation of the feasible region of the Celis-Dennis-Tapia (CDT) problem, which forms a new trust region subproblem. The geometric meaning of a certain parameter of the new trust region subproblem is illustrated. The authors prove that the global solution of the CDT subproblem is given by some specially-located dual maxima and by restricting the location region of the multipliers.
Recommendations
Cited in
(13)- A computational study of global optimization solvers on two trust region subproblems
- Subspace choices for the Celis-Dennis-Tapia problem
- Numerical experience with a polyhedral-norm CDT trust-region algorithm
- A hybrid algorithm for the two-trust-region subproblem
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- A note on polynomial solvability of the CDT problem
- scientific article; zbMATH DE number 2218045 (Why is no real title available?)
- New results on narrowing the duality gap of the extended Celis-Dennis-Tapia problem
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
- An efficient splitting algorithm for solving the CDT subproblem
- On convergence of the block Lanczos method for the CDT subproblem
- On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints
- On KKT points of Celis-Dennis-Tapia subproblem
This page was built for publication: On maxima of dual function of the CDT subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2725276)
