On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
From MaRDI portal
(Redirected from Publication:654068)
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
- scientific article; zbMATH DE number 410743 (Why is no real title available?)
- scientific article; zbMATH DE number 50640 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3037624 (Why is no real title available?)
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Active Sets, Nonsmoothness, and Sensitivity
- Approximating Subdifferentials by Random Sampling of Gradients
- Convergence Properties of the BFGS Algoritm
- Eigenvalues and nonsmooth optimization
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Methods of descent for nondifferentiable optimization
- Nonsmooth optimization via quasi-Newton methods
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Optimization theory and methods. Nonlinear programming
- The BFGS method with exact line searches fails for non-convex objective functions
- Variational Analysis
Cited in
(20)- Enumeration of subdifferentials of piecewise linear functions with ABS-normal form
- A Homogeneous Tensor Framework for High-Order Trust-Region and Spherical Polynomial Optimization
- An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization
- Nonsmooth optimization via quasi-Newton methods
- Worst case complexity of direct search
- First- and second-order optimality conditions for piecewise smooth objective functions
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- On a Frank-Wolfe approach for abs-smooth functions
- 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
- Moreau envelope and proximal-point methods under the lens of high-order regularization
- Stochastic optimization under hidden convexity
- 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
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)
