Characterizations of full stability in constrained optimization (Q2866208)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterizations of full stability in constrained optimization |
scientific article; zbMATH DE number 6238061
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizations of full stability in constrained optimization |
scientific article; zbMATH DE number 6238061 |
Statements
13 December 2013
0 references
full Lipschitzian stability
0 references
parameterized optimization problem
0 references
strong regularity
0 references
nonlinear programming
0 references
second-order subdifferentials
0 references
parametric prox-regularity
0 references
amenability
0 references
Characterizations of full stability in constrained optimization (English)
0 references
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.
0 references
