Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem

DOI10.1007/s10957-012-0041-6zbMath1256.90032MaRDI QIDQ1937005

Hoang Ngoc Tuan

Publication date: 11 February 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-012-0041-6

zbMATH Keywords

Lagrange multiplier; convergence rate; trust-region subproblem; DCA sequence; KKT point

Mathematics Subject Classification ID

90C20: Quadratic programming

Related Items

A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program, Linear convergence of a type of iterative sequences in nonconvex quadratic programming, Convergence analysis of difference-of-convex algorithm with subanalytic data, DC programming and DCA: thirty years of developments, Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems, Boundedness of a type of iterative sequences in two-dimensional quadratic programming, The boosted DC algorithm for linearly constrained DC programming

Cites Work

• Behavior of DCA sequences for solving the trust-region subproblem
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Trust Region Methods
• Unnamed Item
• Unnamed Item