Generic minimizing behavior in semialgebraic optimization
From MaRDI portal
Abstract: We present a theorem of Sard type for semi-algebraic set-valued mappings whose graphs have dimension no larger than that of their range space: the inverse of such a mapping admits a single-valued analytic localization around any pair in the graph, for a generic value parameter. This simple result yields a transparent and unified treatment of generic properties of semi-algebraic optimization problems: "typical" semi-algebraic problems have finitely many critical points, around each of which they admit a unique "active manifold" (analogue of an active set in nonlinear optimization); moreover, such critical points satisfy strict complementarity and second-order sufficient conditions for optimality are indeed necessary.
Recommendations
- Generic properties for semialgebraic programs
- Generic optimality conditions for semialgebraic convex programs
- Stability and genericity for semi-algebraic compact programs
- On the generic properties of convex optimization problems in conic form
- Semialgebraic Sard theorem for generalized critical values.
Cites work
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A point-of-attraction result for Newton's method with point-based approximations
- Active Sets, Nonsmoothness, and Sensitivity
- An Increasing Continuous Singular Function
- An Invitation to Tame Optimization
- Clarke subgradients for directionally Lipschitzian stratifiable functions
- Clarke Subgradients of Stratifiable Functions
- Complementarity and nondegeneracy in semidefinite programming
- Continuity and differentiability of set-valued maps revisited in the light of tame geometry
- Critical values of set-valued maps with stratifiable graphs. Extensions of Sard and Smale-Sard theorems
- Equations on monotone graphs
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Finite termination of the proximal point algorithm
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First and second order analysis of nonlinear semidefinite programs
- Generic nondegeneracy in convex optimization
- Generic optimality conditions for semialgebraic convex programs
- Generic properties of the complementarity problem
- Geometric categories and o-minimal structures
- scientific article; zbMATH DE number 192849 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2155014 (Why is no real title available?)
- scientific article; zbMATH DE number 3381034 (Why is no real title available?)
- Identifiable Surfaces in Constrained Optimization
- Identifying active manifolds.
- Implicit Functions and Solution Mappings
- Lagrange Multipliers and Optimality
- Manifold identification in dual averaging for regularized stochastic online learning
- Metric regularity and subdifferential calculus
- Monotone (nonlinear) operators in Hilbert space
- Nonsmooth optimization: conditioning, convergence and semi-algebraic models
- On finite convergence and constraint identification of subgradient projection methods
- On optimality conditions for structured families of nonlinear programming problems
- On the convergence of projected gradient processes to singular critical points
- On the generic properties of convex optimization problems in conic form
- On the Identification of Active Constraints
- On the Identification of Active Constraints II: The Nonconvex Case
- Optimality, identifiability, and sensitivity
- Partial Smoothness, Tilt Stability, and Generalized Hessians
- Projected gradient methods for linearly constrained problems
- Prox-regular functions in variational analysis
- Quadratic growth and critical point stability of semi-algebraic functions
- Second-order growth, tilt stability, and metric regularity of the subdifferential
- Semi-algebraic functions have small subdifferentials
- Tangents to an analytic variety
- The dimension of semialgebraic subdifferential graphs
- The Generic Nature of Optimality Conditions in Nonlinear Programming
- Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential
- Variational Analysis
- Variational analysis and mathematical economics. II: Nonsmooth regular economies
Cited in
(20)- A generalized semi-Pareto minification process
- Genericity and Hölder stability in semi-algebraic variational inequalities
- Proximal methods avoid active strict saddles of weakly convex functions
- Stability and genericity for semi-algebraic compact programs
- Generic optimality conditions for semialgebraic convex programs
- Sensitivity analysis for mirror-stratifiable convex functions
- Qualification Conditions in Semialgebraic Programming
- Partial smoothness and constant rank
- Escaping strict saddle points of the Moreau envelope in nonsmooth optimization
- On the simplicity and conditioning of low rank semidefinite programs
- A note on alternating projections for ill-posed semidefinite feasibility problems
- Generic properties for semialgebraic programs
- A strict complementarity approach to error bound and sensitivity of solution of conic programs
- On continuous selections of polynomial functions
- Asymptotic normality and optimality in nonsmooth stochastic approximation
- A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
- Identifiability, the KL property in metric spaces, and subgradient curves
- On the analysis of semismooth Newton-type methods for composite optimization
- Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization
- Inertial Bregman proximal gradient under partial smoothness
This page was built for publication: Generic minimizing behavior in semialgebraic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789611)
