Nonsmooth spectral gradient methods for unconstrained optimization

DOI10.1007/s13675-017-0080-8zbMath1381.49026OpenAlexW2582146596MaRDI QIDQ1688945

Debora Cores, Hugo Aponte, Marcos Raydan, Milagros C. Loreto

Publication date: 12 January 2018

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-017-0080-8

zbMATH Keywords

nonsmooth optimizationspectral gradient methodderivative-free optimizationnon-monotone line searchsimplex gradientssampling gradients

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Nonsmooth analysis (49J52)

Related Items

A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems, A fast gradient and function sampling method for finite-max functions

Uses Software

• IMFIL
• GradSamp

Cites Work

• Spectral projected subgradient with a momentum term for the Lagrangean dual approach
• A derivative-free nonmonotone line-search technique for unconstrained optimization
• The calculus of simplex gradients
• Convergence analysis for the modified spectral projected subgradient method
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
• On the differentiability check in gradient sampling methods
• An adaptive gradient sampling algorithm for non-smooth optimization
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
• Using Sampling and Simplex Derivatives in Pattern Search Methods
• Using simplex gradients of nonsmooth functions in direct search methods
• Introduction to Derivative-Free Optimization
• Two-Point Step Size Gradient Methods
• Optimization of lipschitz continuous functions
• A Nonmonotone Line Search Technique for Newton’s Method
• On the Barzilai and Borwein choice of steplength for the gradient method
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Approximating Subdifferentials by Random Sampling of Gradients
• Unnamed Item
• Unnamed Item
• Unnamed Item