Continuous approximations to generalized jacobians
The well-known properties of \(\varepsilon -\)subdifferentials as some kind of numerically stable, and upper semi-continuous approximation of subdifferentials are used to define three Hausdorff upper semicontinuous approximations (not necessarily convex valued) of the Jacobian of a non-smooth Lipschitz map between finite dimensional spaces defined on a compact set (sect. 3 \textit{uniform}, sect. 4 \textit{strong}, sect. 5 \textit{weak} \textit{approximation}, weaker in this order). If such an approximation is known for the nonsmooth part of a composition the approximation of the composition is given similar to that one of the usual subgradient (chain rule). If the considered subdifferential is a Cartesian product then its above approximations have this property, too. Above that a \textit{pertinent weak} approximation of a composition of two Lipschitz maps is given by the product of the pertinent weak approximation of each map (chain rule). They can be used to construct point-based set-valued approximations. The strong approximation is also uniform for Lipschitz maps. In this case the family of \(\varepsilon -\)generalized Jacobians gives a strong (and uniform) approximation of Clarke's generalized Jacobian. The paper generalizes considerations in [\textit{A. M. Rubinov}, Lect. Notes Econ. Math. Syst. 255, 74-86 (1985; Zbl 0601.49007)], [\textit{V. F. Demyanov} and \textit{A. M. Rubinov}, ``Constructive nonsmooth analysis (1995; Zbl 0887.49014)], [\textit{A. D. Ioffe}, Trans. Am. Math. Soc. 266, 1-56 (1981; Zbl 0651.58007)] and [\textit{H. Xu} and \textit{X. W. Chang}, J. Optimization Theory Appl. 93, No. 2, 373-394 (1997; Zbl 0899.90150)].
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Continuous subdifferential approximation and its construction
- scientific article; zbMATH DE number 1214046
- An open mapping theorem using unbounded generalized Jacobians
- Chain rules for approximate Jacobians of continuous functions
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
- A nonsmooth version of Newton's method
- Algorithm Models for Nondifferentiable Optimization
- Algorithms for some minimax problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Fat homeomorphisms and unbounded derivate containers
- scientific article; zbMATH DE number 3932969 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- Methods of descent for nondifferentiable optimization
- New version of the Newton method for nonsmooth equations
- Newton's method for a class of nonsmooth functions
- Nondifferential optimization via adaptive smoothing
- Nonsmooth Equations: Motivation and Algorithms
- On generalized differentials and subdifferentials of Lipschitz vector-valued functions
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- On the Subdifferentiability of Convex Functions
- Optimization and nonsmooth analysis
- Optimization of Lipschitz continuous functions
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- Set-valued approximations and Newton's methods
- Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
- An open mapping theorem using unbounded generalized Jacobians
- Chain rules for approximate Jacobians of continuous functions
- Relationships between approximate Jacobians and coderivatives
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- scientific article; zbMATH DE number 1214046 (Why is no real title available?)
- scientific article; zbMATH DE number 1421094 (Why is no real title available?)
- Smooth Approximation of Lipschitz Maps and Their Subgradients
- 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
- Repeatable approximation of the Jacobian pseudo-inverse
This page was built for publication: Continuous approximations to generalized jacobians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944357)