Tame functions are semismooth
From MaRDI portal
Publication:959961
DOI10.1007/s10107-007-0166-9zbMath1158.49030OpenAlexW2112729692MaRDI QIDQ959961
Aris Daniilidis, Jérôme Bolte, Adrian S. Lewis
Publication date: 16 December 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0166-9
superlinear convergencesemismoothnesso-minimal structuresemi-algebraic functionnonsmooth Newton methodstructured optimization problem
Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Semialgebraic sets and related spaces (14P10)
Related Items
Extended semismooth Newton method for functions with values in a cone ⋮ Newton Differentiability of Convex Functions in Normed Spaces and of a Class of Operators ⋮ Qualification Conditions in Semialgebraic Programming ⋮ Conservative and semismooth derivatives are equivalent for semialgebraic maps ⋮ Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application ⋮ Semismoothness for Solution Operators of Obstacle-Type Variational Inequalities with Applications in Optimal Control ⋮ Error bounds and Hölder metric subregularity ⋮ An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming ⋮ Generalized gradients in dynamic optimization, optimal control, and machine learning problems ⋮ Strong semismoothness of projection onto slices of second-order cone ⋮ Local convergence of Newton's method for subanalytic variational inclusions ⋮ Directed subdifferentiable functions and the directed subdifferential without delta-convex structure ⋮ Inexact Half-Quadratic Optimization for Linear Inverse Problems ⋮ Projection Methods in Conic Optimization ⋮ On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors ⋮ Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks ⋮ On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives ⋮ On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence ⋮ Definable Zero-Sum Stochastic Games ⋮ A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets
Cites Work
- Solution dependence on initial conditions in differential variational inequalities
- Semianalytic and subanalytic sets
- On gradients of functions definable in o-minimal structures
- Newton's method for a class of nonsmooth functions
- Error bounds for analytic systems and their applications
- Structural analysis of nonsmooth mappings, inverse functions, and metric projections
- On concepts of directional differentiability
- Geometric categories and o-minimal structures
- A nonsmooth version of Newton's method
- A nonsmooth Morse--Sard theorem for subanalytic functions
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Semismooth and Semiconvex Functions in Constrained Optimization
- Penalty functions in subanalytic optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Clarke critical values of subanalytic Lipschitz continuous functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
