A class of nonmonotone trust region algorithms for unconstrained optimization problems
From MaRDI portal
Publication:1286707
DOI10.1007/BF02880001zbMath0917.90271MaRDI QIDQ1286707
Publication date: 29 April 1999
Published in: Science in China. Series A (Search for Journal in Brave)
Related Items
Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds ⋮ Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters ⋮ A nonmonotone trust region method with new inexact line search for unconstrained optimization ⋮ A new modified nonmonotone adaptive trust region method for unconstrained optimization ⋮ A nonmonotone adaptive trust region method based on conic model for unconstrained optimization ⋮ Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems ⋮ Combining nonmonotone conic trust region and line search techniques for unconstrained optimization ⋮ Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Nonmonotonic trust region algorithm
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A Nonmonotone Line Search Technique for Newton’s Method
- Curvilinear path and trust region in unconstrained optimization: A convergence analysis