A new nonmonotone line search method for nonsmooth nonconvex optimization

DOI10.1080/02331934.2022.2108709OpenAlexW4295969759MaRDI QIDQ6198510

No author found.

Publication date: 23 February 2024

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2022.2108709

zbMATH Keywords

global convergenceLipschitz functionsminimization algorithmnonmonotone line search methodNN Armijo condition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• Unnamed Item
• Nonsmooth optimization via quasi-Newton methods
• Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
• Global convergence of nonmonotone descent methods for unconstrained optimization problems
• A bundle-Newton method for nonsmooth unconstrained minimization
• A trust region algorithm for minimization of locally Lipschitzian functions
• Continuous subdifferential approximations and their applications
• Nonmonotone trust region method for solving optimization problems
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• Methods of descent for nondifferentiable optimization
• Optimization theory and methods. Nonlinear programming
• Introduction to Nonsmooth Optimization
• A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
• Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Numerical Optimization
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• Generalized Bundle Methods
• Survey of Bundle Methods for Nonsmooth Optimization
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• New limited memory bundle method for large-scale nonsmooth optimization
• Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
• On the nonmonotone line search

This page was built for publication: A new nonmonotone line search method for nonsmooth nonconvex optimization