Nonsmooth spectral gradient methods for unconstrained optimization

DOI10.1007/S13675-017-0080-8MaRDI QIDQ1688945zbMATH OpenOpenAlexFDO

Authors Hugo Aponte, Debora Cores, Milagros C. Loreto, M. Raydan

Publication date 12 January 2018

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

nonsmooth optimizationderivative-free optimizationnon-monotone line searchspectral gradient methodsimplex gradientssampling gradients

Mathematics Subject Classification ID

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

Recommendations

• A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
• A spectral-type conjugate gradient method for nonsmooth convex minimization
• A new spectral gradient method for unconstrained optimization
• Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem
• scientific article; zbMATH DE number 5961789

Cites work

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

Cited in

(7)

• A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
• Spectral projected subgradient method for nonsmooth convex optimization problems
• A new sequential optimality condition for constrained nonsmooth optimization
• A fast gradient and function sampling method for finite-max functions
• Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
• Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
• scientific article; zbMATH DE number 5961789 (Why is no real title available?)

Describes a project that uses

Uses Software

• GradSamp
• IMFIL

This page was built for publication: Nonsmooth spectral gradient methods for unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688945)