Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
From MaRDI portal
Publication:1937005
DOI10.1007/S10957-012-0041-6zbMATH Open1256.90032OpenAlexW2058514739MaRDI QIDQ1937005FDOQ1937005
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
Recommendations
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- The convergence of subspace trust region methods
- scientific article; zbMATH DE number 1131709
- On the convergence of a new trust region algorithm
- The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
- Convergence properties of trust region methods for linear and convex constraints
- Convergence rate of the trust region method for nonlinear equations under local error bound condition
- scientific article; zbMATH DE number 938979
- On the convergence of a wide range of trust region methods for unconstrained optimization
- scientific article; zbMATH DE number 784939
Cites Work
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Trust Region Methods
- Handbook of applied optimization
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Behavior of DCA sequences for solving the trust-region subproblem
- Title not available (Why is that?)
Cited In (7)
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- DC programming and DCA: thirty years of developments
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming
- The boosted DC algorithm for linearly constrained DC programming
This page was built for publication: Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937005)
