Algorithmic construction of the subdifferential from directional derivatives

DOI10.1007/s11228-016-0388-1zbMath1403.52009arXiv1609.02928OpenAlexW2294305148MaRDI QIDQ2413566

Charles Audet, Warren L. Hare

Publication date: 14 September 2018

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.02928

zbMATH Keywords

subdifferentialdirectional derivativegeometric probingpolyhedral construction

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Nonlinear programming (90C30) Set-valued and variational analysis (49J53) Numerical methods based on nonlinear programming (49M37) Numerical methods for variational inequalities and related problems (65K15)

Related Items (1)

A discussion on variational analysis in derivative-free optimization

Uses Software

• DGM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A derivative-free approximate gradient sampling algorithm for finite minimax problems
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
• Reconstruction of polygons from projections
• A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
• Shape from probing
• Parallel strategies for geometric probing
• Variational Analysis
• Analysis of Generalized Pattern Searches
• Shape from Silhouettes in Discrete Space
• Derivative-free optimization methods for finite minimax problems
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization

This page was built for publication: Algorithmic construction of the subdifferential from directional derivatives