A modified ODE-based algorithm for unconstrained optimization problems
From MaRDI portal
Publication:2248961
DOI10.1007/s11075-013-9703-1zbMath1291.65176MaRDI QIDQ2248961
Publication date: 27 June 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-013-9703-1
unconstrained optimization; global convergence; nonmonotone technique; ODE-based methods; IMPBOT algorithm
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
Uses Software
Cites Work
- Unnamed Item
- Nonmonotone adaptive trust region method
- A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
- A nonmonotone trust region method for unconstrained optimization
- An ODE-based trust region method for unconstrained optimization problems
- On the limited memory BFGS method for large scale optimization
- A nonmonotone trust-region method of conic model for unconstrained optimization
- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Nonmonotonic trust region algorithm
- Representations of quasi-Newton matrices and their use in limited memory methods
- A class of nonmonotone stabilization trust region methods
- Nonmonotone trust region method for solving optimization problems
- The convergence of subspace trust region methods
- An unconstrained optimization method using nonmonotone second order Goldstein's line search
- Optimization theory and methods. Nonlinear programming
- Testing Unconstrained Optimization Software
- Trust Region Algorithms and Timestep Selection
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
