Scaled optimal path trust-region algorithm
From MaRDI portal
Publication:1306663
DOI10.1023/A:1021846613163zbMath0939.90018OpenAlexW206581499MaRDI QIDQ1306663
Cheng-Xian Xu, Zhang, Jianzhong
Publication date: 5 October 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021846613163
unconstrained optimizationglobal convergencetrust-region methodsoptimal pathsBunch-Parlett factorizationlocal convergence rates
Related Items (3)
The convergence of subspace trust region methods ⋮ A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization ⋮ Nonmonotone adaptive trust region method
Uses Software
Cites Work
- A restricted trust region algorithm for unconstrained optimization
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- More test examples for nonlinear programming codes
- Two new unconstrained optimization algorithms which use function and gradient values
- Newton-Type Minimization via the Lanczos Method
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- Computing a Trust Region Step
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Testing Unconstrained Optimization Software
- Newton’s Method with a Model Trust Region Modification
- An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
- Curvilinear path and trust region in unconstrained optimization: A convergence analysis
This page was built for publication: Scaled optimal path trust-region algorithm
