On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
From MaRDI portal
Publication:654068
DOI10.1016/J.NA.2011.07.062zbMATH Open1269.49018OpenAlexW2146018083MaRDI QIDQ654068FDOQ654068
Authors: Mert Gürbüzbalaban, Michael L. Overton 
Publication date: 21 December 2011
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2011.07.062
Recommendations
- On Nesterov's smooth Chebyshev-Rosenbrock function
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
- Nonsmoothness and a variable metric method
- Nonsmooth optimization via quasi-Newton methods
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Variational Analysis
- Title not available (Why is that?)
- Optimization theory and methods. Nonlinear programming
- Title not available (Why is that?)
- Methods of descent for nondifferentiable optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Nonsmooth optimization via quasi-Newton methods
- Approximating Subdifferentials by Random Sampling of Gradients
- The BFGS method with exact line searches fails for non-convex objective functions
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Convergence Properties of the BFGS Algoritm
- Active Sets, Nonsmoothness, and Sensitivity
- Eigenvalues and nonsmooth optimization
Cited In (16)
- An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization
- Nonsmooth optimization via quasi-Newton methods
- First- and second-order optimality conditions for piecewise smooth objective functions
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Worst case complexity of direct search
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- On Lipschitz optimization based on gray-box piecewise linearization
- Finite convergence of an active signature method to local minima of piecewise linear functions
- On Nesterov's smooth Chebyshev-Rosenbrock function
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- Characterizing and testing subdifferential regularity in piecewise smooth optimization
- Nonsmoothness and a variable metric method
- An algorithm for nonsmooth optimization by successive piecewise linearization
- A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
- A geometric integration approach to nonsmooth, nonconvex optimisation
- Enumeration of subdifferentials of piecewise linear functions with ABS-normal form
Uses Software
This page was built for publication: On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654068)
