Tame functions are semismooth
From MaRDI portal
Recommendations
- Totally semi-continuous functions
- Tameness in Fréchet spaces of analytic functions
- Semismooth properties of a class of integral functions
- Almost smooth functions
- Tame functionals on Banach algebras
- scientific article; zbMATH DE number 598204
- Semismooth implicit functions
- scientific article; zbMATH DE number 1305636
- On almost smooth functions and piecewise smooth functions
- Tame degree functions in arbitrary characteristic
Cites work
- scientific article; zbMATH DE number 6728329 (Why is no real title available?)
- scientific article; zbMATH DE number 45943 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 1552023 (Why is no real title available?)
- A nonsmooth Morse--Sard theorem for subanalytic functions
- A nonsmooth version of Newton's method
- Clarke critical values of subanalytic Lipschitz continuous functions
- Error bounds for analytic systems and their applications
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Geometric categories and o-minimal structures
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Newton's method for a class of nonsmooth functions
- On concepts of directional differentiability
- On gradients of functions definable in o-minimal structures
- Penalty functions in subanalytic optimization
- Semianalytic and subanalytic sets
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solution dependence on initial conditions in differential variational inequalities
- Structural analysis of nonsmooth mappings, inverse functions, and metric projections
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Cited in
(27)- An Invitation to Tame Optimization
- An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
- Directed subdifferentiable functions and the directed subdifferential without delta-convex structure
- Qualification Conditions in Semialgebraic Programming
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- Inexact half-quadratic optimization for linear inverse problems
- A superlinearly convergent smoothing Newton continuation algorithm for variational inequalities over definable sets
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Newton differentiability of convex functions in normed spaces and of a class of operators
- Definable zero-sum stochastic games
- Generalized gradients in dynamic optimization, optimal control, and machine learning problems
- Extended semismooth Newton method for functions with values in a cone
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- Conservative and semismooth derivatives are equivalent for semialgebraic maps
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
- Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks
- A semismooth Newton stochastic proximal point algorithm with variance reduction
- On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives
- Semismoothness for Solution Operators of Obstacle-Type Variational Inequalities with Applications in Optimal Control
- Strong semismoothness of projection onto slices of second-order cone
- Local convergence of Newton's method for subanalytic variational inclusions
- Efficient proximal subproblem solvers for a nonsmooth trust-region method
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- Projection Methods in Conic Optimization
- Error bounds and Hölder metric subregularity
This page was built for publication: Tame functions are semismooth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959961)
