Optimality, identifiability, and sensitivity
read the original abstract
Around a solution of an optimization problem, an "identifiable" subset of the feasible region is one containing all nearby solutions after small perturbations to the problem. A quest for only the most essential ingredients of sensitivity analysis leads us to consider identifiable sets that are "minimal". This new notion lays a broad and intuitive variational-analytic foundation for optimality conditions, sensitivity, and active set methods.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Stochastic algorithms with geometric step decay converge linearly on sharp functions
Geometric step decay yields local linear convergence for stochastic algorithms on sharp nonconvex problems and gives matching or new guarantees for phase retrieval and blind deconvolution under Gaussian and heavy-tail...
-
Identifiability and Error Bound: Metric and Geometric Perspectives
Local error bound in ambient Euclidean space is equivalent to local error bound on the identifiable manifold under mild assumptions, shown via metric and geometric arguments.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.