Characterizations of full stability in constrained optimization

From MaRDI portal





The authors provide new characterizations of full Lipschitzian stability in constrained optimization. Based on tools from nonsmooth and variational analysis, necessary and sufficient conditions for fully stable local minimizers in different classes of optimization problems are derived. This includes problems of composite optimization, mathematical programs with polyhedral constraints and problems of extended and classical nonlinear programming with twice continuously differentiable data.




Cited in
(52)








This page was built for publication: Characterizations of full stability in constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866208)