An ODE-based trust region method for unconstrained optimization problems
From MaRDI portal
Publication:843138
DOI10.1016/j.cam.2009.06.012zbMath1176.90577OpenAlexW2082996903MaRDI QIDQ843138
Qian Zhou, Haichan Lin, Yi-gui Ou
Publication date: 29 September 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2009.06.012
Related Items (6)
Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization ⋮ Accelerating optimization by tracing valley ⋮ A modified ODE-based algorithm for unconstrained optimization problems ⋮ A new supermemory gradient method for unconstrained optimization problems ⋮ A hybrid trust region algorithm for unconstrained optimization ⋮ A hybrid ODE-based method for unconstrained optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- A nonmonotone trust region method for unconstrained optimization
- A superlinearly convergent ODE-type trust region algorithm for nonsmooth nonlinear equations
- Global convergence of a memory gradient method without line search
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Nonmonotonic trust region algorithm
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Combining trust region and linesearch algorithm for equality constrained optimization
- A superlinearly convergent trust region algorithm for \(LC^1\) constrained optimization problems
- Global convergence of conjugate gradient methods without line search
This page was built for publication: An ODE-based trust region method for unconstrained optimization problems
