Approximating Clarke's subgradients of semismooth functions by divided differences
DOI10.1007/S11075-007-9069-3zbMATH Open1133.65043OpenAlexW1982706353MaRDI QIDQ877273FDOQ877273
Authors: Rahmo El-Desouky, Marcin Studniarski
Publication date: 19 April 2007
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-007-9069-3
Recommendations
- Continuous subdifferential approximation and its construction
- Are the approximate and the Clarke subgradients generically equal?
- scientific article; zbMATH DE number 812526
- Continuous subdifferential approximations and their applications
- Approximating Subdifferentials by Random Sampling of Gradients
convergencenumerical examplesalgorithmnondifferentiable functionsClarke's subgradientssemismooth functions
Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Constrained optimal control of Navier--Stokes flow by semismooth Newton methods
- An Algorithm for Constrained Optimization with Semismooth Functions
- Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
- A SQP-Semismooth Newton-type Algorithm applied to Control of the instationary Navier--Stokes System Subject to Control Constraints
- A mesh-independence result for semismooth Newton methods.
- Semismooth Newton Methods for Operator Equations in Function Spaces
- Second-Order Necessary Conditions in Constrained Semismooth Optimization
- An approximate Newton method for non-smooth equations with finite max functions
- Title not available (Why is that?)
- An algorithm for calculating one subgradient of a convex function of two variables
- A method for minimizing convex functions based on continuous approximations to the subdifferential
Cited In (4)
This page was built for publication: Approximating Clarke's subgradients of semismooth functions by divided differences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877273)