An unconstrained optimization method using nonmonotone second order Goldstein's line search
From MaRDI portal
Publication:2464310
DOI10.1007/s11425-007-0072-xzbMath1132.65057OpenAlexW2107854223MaRDI QIDQ2464310
Publication date: 19 December 2007
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-007-0072-x
algorithmunconstrained optimizationnumerical examplesline searchill-conditioned problemsdescent pairnonmonotone methoddirection of negative curvature
Related Items (19)
A nonmonotonic hybrid algorithm for min-max problem ⋮ A nonmonotone trust region method based on simple conic models for unconstrained optimization ⋮ A memory gradient method based on the nonmonotone technique ⋮ Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters ⋮ A nonmonotone line search slackness technique for unconstrained optimization ⋮ A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization ⋮ Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems ⋮ A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION ⋮ A modified ODE-based algorithm for unconstrained optimization problems ⋮ A nonmonotone trust region method based on simple quadratic models ⋮ A new nonmonotone adaptive trust region method based on simple quadratic models ⋮ An ODE-based nonmonotone method for unconstrained optimization problems ⋮ A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming ⋮ An improved trust region method for unconstrained optimization ⋮ A nonmonotone supermemory gradient algorithm for unconstrained optimization ⋮ A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem ⋮ A dwindling filter line search method for unconstrained optimization ⋮ On filter-successive linearization methods for nonlinear semidefinite programming ⋮ A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- Nonmonotonic trust region algorithm
- Nonmonotone adaptive trust-region method for unconstrained optimization problems
- Nonmonotone curvilinear line search methods for unconstrained optimization
- Nonmonotone trust region method for solving optimization problems
- Optimization theory and methods. Nonlinear programming
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- Testing Unconstrained Optimization Software
- A modification of Armijo's step-size rule for negative curvature
- On the use of directions of negative curvature in a modified newton method
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
- A Nonmonotone Line Search Technique for Newton’s Method
This page was built for publication: An unconstrained optimization method using nonmonotone second order Goldstein's line search