Global convergence of nonmonotone descent methods for unconstrained optimization problems
From MaRDI portal
This paper deals with global convergence for unconstrained optimization algorithms that utilize a nonmonotone line search procedure. The proposed technique allows the user to specify a flexible facing function and includes Armijo, Goldstein and Wolfe rules as special cases. The global convergence (towards stationary points) of the nonmonotone descent method for unconstrained optimization is proved.
Recommendations
- A nonmonotone line search method and its convergence for unconstrained optimization
- A nonmonotone trust region technique for unconstrained optimization problems
- Global convergence of a memory gradient method with nonmonotone technique for unconstrained optimization
- The global convergence of the non-quasi-Newton methods with non-monotone line search
- A new nonmonotone line search technique for unconstrained optimization
Cites work
- A nonmonotone inexact Newton algorithm for nonlinear systems of equations
- A Nonmonotone Line Search Technique for Newton’s Method
- A truncated Newton method with non-monotone line search for unconstrained optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- scientific article; zbMATH DE number 107485 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 895356 (Why is no real title available?)
- scientific article; zbMATH DE number 938958 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Introduction to numerical analysis. Translated from the German by R. Bartels, W. Gautschi and C. Witzgall.
- Nonmonotonic trust region algorithm
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Trust region algorithm for nonsmooth optimization
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
Cited in
(59)- A modified SQP method with nonmonotone technique and its global convergence
- On the convergence of curvilinear search algorithms in unconstrained optimization
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Two accelerated nonmonotone adaptive trust region line search methods
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Nonmonotone adaptive trust-region method for unconstrained optimization problems
- Nonmonotone trust region method for solving optimization problems
- A survey of gradient methods for solving nonlinear optimization
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- A class on nonmonotone stabilization methods in unconstrained optimization
- Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
- A modified trust region method with beale's PCG technique for optimization
- A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization
- An unconstrained optimization method using nonmonotone second order Goldstein's line search
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- A smoothing and regularization Broyden-like method for nonlinear inequalities
- A new family of conjugate gradient methods
- An adaptive nonmonotone line search technique for solving systems of nonlinear equations
- Global convergence of a curvilinear search for non-convex optimization
- A nonmonotone line search method and its convergence for unconstrained optimization
- A modified non-monotone BFGS method for non-convex unconstrained optimization
- An adaptive conic trust-region method for unconstrained optimization
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- A Trust Region Algorithm with Memory for Equality Constrained Optimization
- Convergence of memory gradient methods
- A nonmonotone filter Barzilai-Borwein method for optimization
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- A nonmonotone line search slackness technique for unconstrained optimization
- New cautious BFGS algorithm based on modified Armijo-type line search
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds
- scientific article; zbMATH DE number 2069382 (Why is no real title available?)
- scientific article; zbMATH DE number 853073 (Why is no real title available?)
- Application of scaled nonlinear conjugate-gradient algorithms to the inverse natural convection problem
- Global rates of convergence for nonconvex optimization on manifolds
- Modified nonmonotone Armijo line search for descent method
- The global convergence of the non-quasi-Newton methods with non-monotone line search
- A kind of nonmonotone filter method for nonlinear complementarity problem
- scientific article; zbMATH DE number 5051694 (Why is no real title available?)
- A new nonmonotone line search technique for unconstrained optimization
- Sharp global convergence guarantees for iterative nonconvex optimization with random data
- Adaptive nonmonotone line search method for unconstrained optimization
- The convergence of conjugate gradient method with nonmonotone line search
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems
- Nonmonotone BFGS-trained recurrent neural networks for temporal sequence processing
- Nonmonotone alternative direction method based on simple conic model for unconstrained optimization
- A new class of nonmonotone conjugate gradient training algorithms
- A conic regularized Barzilai-Borwein trust region method for large scale unconstrained optimization
- Convergence of descent method with new line search
- A globally convergent descent method for nonsmooth variational inequalities
- New inexact line search method for unconstrained optimization
- Global convergence of the non-quasi-Newton method for unconstrained optimization problems
- Strong global convergence of an adaptive nonmonotone memory gradient method
- Multivariate spectral gradient method for unconstrained optimization
- Convergence of PRP method with new nonmonotone line search
- Globalizing a nonsmooth Newton method via nonmonotone path search
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
This page was built for publication: Global convergence of nonmonotone descent methods for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697549)