On maxima of dual function of the CDT subproblem

MaRDI QIDQ2725276zbMATH OpenFDO

Authors Xiongda Chen, Yaxiang Yuan

Publication date 30 October 2001

Published in Journal of Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximationCelis-Dennis-Tapia problemdual functionglobal minimizertrust region subproblem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• On KKT points of Celis-Dennis-Tapia subproblem
• Subspace choices for the Celis-Dennis-Tapia problem
• scientific article; zbMATH DE number 2218045
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem

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

Describes a project that uses

Uses Software

• GQTPAR

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)