Generic Minimizing Behavior in Semialgebraic Optimization
DOI10.1137/15M1020770zbMath1334.49057arXiv1504.07694OpenAlexW2270772205MaRDI QIDQ2789611
Alexander D. Ioffe, Adrian S. Lewis, Dmitriy Drusvyatskiy
Publication date: 2 March 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07694
subdifferentialstrong regularitymetric regularityactive setquadratic growthSard-type theoremidentifiable manifoldsemialgebraic set-valued mappings
Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Semialgebraic sets and related spaces (14P10) Semi-analytic sets, subanalytic sets, and generalizations (32B20)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semi-algebraic functions have small subdifferentials
- Equations on monotone graphs
- Optimality, identifiability, and sensitivity
- The dimension of semialgebraic subdifferential graphs
- Quadratic growth and critical point stability of semi-algebraic functions
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Monotone (nonlinear) operators in Hilbert space
- Finite termination of the proximal point algorithm
- Complementarity and nondegeneracy in semidefinite programming
- First and second order analysis of nonlinear semidefinite programs
- On finite convergence and constraint identification of subgradient projection methods
- On the convergence of projected gradient processes to singular critical points
- Geometric categories and o-minimal structures
- Tangents to an analytic variety
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A point-of-attraction result for Newton's method with point-based approximations
- Variational analysis and mathematical economics 2: Nonsmooth regular economies
- Continuity and differentiability of set-valued maps revisited in the light of tame geometry
- Identifiable Surfaces in Constrained Optimization
- Lagrange Multipliers and Optimality
- Generic Optimality Conditions for Semialgebraic Convex Programs
- On the Identification of Active Constraints II: The Nonconvex Case
- Clarke Subgradients of Stratifiable Functions
- Critical values of set-valued maps with stratifiable graphs. Extensions of Sard and Smale-Sard theorems
- Implicit Functions and Solution Mappings
- An Invitation to Tame Optimization
- Projected gradient methods for linearly constrained problems
- On the Identification of Active Constraints
- The Generic Nature of Optimality Conditions in Nonlinear Programming
- On optimality conditions for structured families of nonlinear programming problems
- An Increasing Continuous Singular Function
- Variational Analysis
- Metric regularity and subdifferential calculus
- Generic properties of the complementarity problem
- Active Sets, Nonsmoothness, and Sensitivity
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Prox-regular functions in variational analysis
- Second-order growth, tilt stability, and metric regularity of the subdifferential
- Generic nondegeneracy in convex optimization
- Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions
- Partial Smoothness, Tilt Stability, and Generalized Hessians
- Tilt Stability, Uniform Quadratic Growth, and Strong Metric Regularity of the Subdifferential
- On the generic properties of convex optimization problems in conic form
This page was built for publication: Generic Minimizing Behavior in Semialgebraic Optimization