Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
From MaRDI portal
Publication:1941028
DOI10.1007/s10898-011-9820-0zbMath1287.90046OpenAlexW1992341128MaRDI QIDQ1941028
Hoang Ngoc Tuan, Nguyen Dong Yen
Publication date: 11 March 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9820-0
Related Items
Coderivatives of a Karush-Kuhn-Tucker point set map and applications ⋮ Variational inequalities over Euclidean balls ⋮ The boosted DC algorithm for linearly constrained DC programming ⋮ Convergence analysis of a proximal point algorithm for minimizing differences of functions ⋮ 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 ⋮ Stability for trust-region methods via generalized differentiation ⋮ Boundedness of a type of iterative sequences in two-dimensional quadratic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Behavior of DCA sequences for solving the trust-region subproblem
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Quadratic programming and affine variational inequalities. A qualitative study.
- A trust region SQP algorithm for mixed-integer nonlinear programming
- Computing a Trust Region Step
- Computing Optimal Locally Constrained Steps
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Trust Region Methods
