An Invitation to Tame Optimization
critical valuedefinable setsfunctions and mappingso-minimal structureoptimal controlsemismooth mapping
Inequalities involving derivatives and differential and integral operators (26D10) Miscellaneous topics in real functions (26E99) Semi-analytic sets, subanalytic sets, and generalizations (32B20) Set-valued and variational analysis (49J53) Optimality conditions for free problems in one independent variable (49K05) Critical points of functions and mappings on manifolds (58K05) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)
- A proximal DC approach for quadratic assignment problem
- On tameness of zonoids
- Quantitative analysis of a subgradient-type method for equilibrium problems
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- Convergence of constant step stochastic gradient descent for non-smooth non-convex functions
- Convergence rates for boundedly regular systems
- Directed subdifferentiable functions and the directed subdifferential without delta-convex structure
- Stochastic subgradient method converges on tame functions
- On characterizations of submanifolds via smoothness of the distance function in Hilbert spaces
- Convexity and closure in optimal allocations determined by decomposable measures
- Sard theorems for Lipschitz functions and applications in optimization
- Nonsmooth rank-one matrix factorization landscape
- Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set
- Łojasiewicz-type inequalities and global error bounds for nonsmooth definable functions in o-minimal structures
- Generic minimizing behavior in semialgebraic optimization
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Hölder-like property and metric regularity of a positive-order for implicit multifunctions
- Stability and genericity for semi-algebraic compact programs
- Metric subregularity of multifunctions: first and second order infinitesimal characterizations
- Semi-algebraic functions have small subdifferentials
- A fresh variational-analysis look at the positive semidefinite matrices world
- Sweeping by a tame process
- A variational problem determined by probability measures
- Error bounds and metric subregularity
- On formulae for the Ioffe geometric subdifferential of a supremum function
- Optimality Conditions for Nonconvex Variational Problems with Integral Constraints in Banach Spaces
- Pathological subgradient dynamics
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- Composite optimization by nonconvex majorization-minimization
- Definable zero-sum stochastic games
- Clarke subgradients for directionally Lipschitzian stratifiable functions
- Generic properties for semialgebraic programs
- Well-posedness in unconstrained polynomial optimization problems
- Definable continuous mappings and Whyburn’s conjecture
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- First order inertial optimization algorithms with threshold effects associated with dry friction
- Fast optimization via inertial dynamics with closed-loop damping
- Convergence properties of stochastic proximal subgradient method in solving a class of composite optimization problems with cardinality regularizer
- The dimension of semialgebraic subdifferential graphs
- Global stability of first-order methods for coercive tame functions
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
- Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints
- Convergence of first-order algorithms with momentum from the perspective of an inexact gradient descent method
- Quantifier elimination for normal cone computations
- Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
- A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
- Identifiability, the KL property in metric spaces, and subgradient curves
- Inexact proximal methods for weakly convex functions
- Quasi-Newton methods for monotone inclusions: efficient resolvent calculus and primal-dual algorithms
- The gradient's limit of a definable family of functions admits a variational stratification
- An inexact variable metric proximal linearization method for composite optimization on manifolds
- Quadratic growth and critical point stability of semi-algebraic functions
- Transversality and alternating projections for nonconvex sets
- Error bounds and Hölder metric subregularity
This page was built for publication: An Invitation to Tame Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648535)