A new nonmonotone line search method for nonsmooth nonconvex optimization
From MaRDI portal
Publication:6198510
DOI10.1080/02331934.2022.2108709OpenAlexW4295969759MaRDI QIDQ6198510FDOQ6198510
Authors:
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
Recommendations
global convergenceLipschitz functionsminimization algorithmnonmonotone line search methodNN Armijo condition
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Numerical Optimization
- Optimization theory and methods. Nonlinear programming
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Title not available (Why is that?)
- A bundle-Newton method for nonsmooth unconstrained minimization
- Methods of descent for nondifferentiable optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Title not available (Why is that?)
- A Nonmonotone Line Search Technique for Newton’s Method
- Generalized Bundle Methods
- Nonsmooth optimization via quasi-Newton methods
- Continuous subdifferential approximations and their applications
- Nonmonotone trust region method for solving optimization problems
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Survey of Bundle Methods for Nonsmooth Optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- On the nonmonotone line search
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- A trust region algorithm for minimization of locally Lipschitzian functions
- Introduction to nonsmooth optimization. Theory, practice and software
- 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
This page was built for publication: A new nonmonotone line search method for nonsmooth nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198510)
