Continuous approximations to generalized jacobians
From MaRDI portal
Publication:4944357
DOI10.1080/02331939908844455zbMath0963.49016OpenAlexW2034336709MaRDI QIDQ4944357
No author found.
Publication date: 1 August 2000
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939908844455
upper semicontinuitygeneralized Newton methodgeneralized Jacobianepsilon Jacobianepsilon subdifferential
Related Items (2)
Constructing a sequence of discrete Hessian matrices of an \(SC^{1}\) function uniformly convergent to the generalized Hessian matrix ⋮ New constructions for local approximation of Lipschitz functions. II
Cites Work
- Unnamed Item
- Unnamed Item
- Nondifferential optimization via adaptive smoothing
- Fat homeomorphisms and unbounded derivate containers
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- Newton's method for a class of nonsmooth functions
- New version of the Newton method for nonsmooth equations
- Set-valued approximations and Newton's methods
- Methods of descent for nondifferentiable optimization
- A nonsmooth version of Newton's method
- Algorithms for some minimax problems
- Nonsmooth Equations: Motivation and Algorithms
- Algorithm Models for Nondifferentiable Optimization
- Optimization and nonsmooth analysis
- Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
- On generalized differentials and subdifferentials of Lipschitz vector-valued functions
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Optimization of lipschitz continuous functions
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- On the Subdifferentiability of Convex Functions
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
This page was built for publication: Continuous approximations to generalized jacobians
