An unconstrained optimization method using nonmonotone second order Goldstein's line search
The authors consider the problem of unconstrained minimization of a real-valued twice continuously differentiable function of \(n\) variables. They propose a new unconstrained optimization method using the non-monotone second-order Goldstein linear search, which is different from both the nonmonotone Goldstein step size rule and the curvilinear line search rule. Under mild conditions, the sequence generated by the proposed algorithm is proved to converge to a stationary point satisfying the second-order optimality conditions. Numerical tests presented in the concluding part of the paper show a good numerical behavior of the method in comparison with some other methods from the literature. The method is efficient and robust especially for some ill-conditioned problems.
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A nonmonotone line search method and its convergence for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
- A modification of Armijo's step-size rule for negative curvature
- A Nonmonotone Line Search Technique for Newton’s Method
- An adaptive nonmonotonic trust region method with curvilinear searches
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- scientific article; zbMATH DE number 2069382 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- 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
- Nonmonotonic trust region algorithm
- On the use of directions of negative curvature in a modified newton method
- Optimization theory and methods. Nonlinear programming
- Testing Unconstrained Optimization Software
- Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method
- On filter-successive linearization methods for nonlinear semidefinite programming
- Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization
- A modified ODE-based algorithm for unconstrained optimization problems
- A nonmonotone trust region method based on simple quadratic models
- A nonmonotonic hybrid algorithm for min-max problem
- Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters
- A new nonmonotone adaptive trust region method based on simple quadratic models
- An ODE-based nonmonotone method for unconstrained optimization problems
- A memory gradient method based on the nonmonotone technique
- A nonmonotone trust region method based on simple conic models for unconstrained optimization
- A nonmonotone filter Barzilai-Borwein method for optimization
- A nonmonotone line search slackness technique for unconstrained optimization
- A nonmonotone filter curvilinear line search algorithm for unconstrained nonconvex optimization
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- A nonmonotone second-order steplength method for unconstrained minimization
- A dwindling filter line search method for unconstrained optimization
- An improved trust region method 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 nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
This page was built for publication: An unconstrained optimization method using nonmonotone second order Goldstein's line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464310)
