Optimality, identifiability, and sensitivity
DOI10.1007/s10107-013-0730-4zbMath1301.49059arXiv1207.6628OpenAlexW2125329909MaRDI QIDQ463741
Adrian S. Lewis, Dmitriy Drusvyatskiy
Publication date: 17 October 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.6628
sensitivitynormal coneoptimality conditionssubgradientidentifiabilityactive setprox-regularitycritical cone
Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality, identifiability, and sensitivity
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Computing proximal points of nonconvex functions
- Finite termination of the proximal point algorithm
- 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
- Techniques of variational analysis
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Orthogonal Invariance and Identifiability
- Identifiable Surfaces in Constrained Optimization
- On the Identification of Active Constraints II: The Nonconvex Case
- Implicit Functions and Solution Mappings
- Projected gradient methods for linearly constrained problems
- On the Identification of Active Constraints
- Some continuity properties of polyhedral multifunctions
- Variational Analysis
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- Local differentiability of distance functions
- An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- Variational Analysis and Generalized Differentiation I
- Active Sets, Nonsmoothness, and Sensitivity
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Prox-regular functions in variational analysis
- Partial Smoothness, Tilt Stability, and Generalized Hessians
This page was built for publication: Optimality, identifiability, and sensitivity