Globally convergent algorithms for unconstrained optimization
From MaRDI portal
Publication:1588835
DOI10.1023/A:1008772414083zbMath1017.90107MaRDI QIDQ1588835
Publication date: 26 August 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
unconstrained optimizationglobal convergenceNewton's methodquasi-Newton methodline searchsteepest descent method
Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Numerical methods based on nonlinear programming (49M37)
Related Items (4)
Using gradient directions to get global convergence of Newton-type methods ⋮ Solving a system of nonlinear integral equations by an RBF network ⋮ Globally convergent algorithms for solving unconstrained optimization problems ⋮ A new trust region method with adaptive radius
This page was built for publication: Globally convergent algorithms for unconstrained optimization
