Primal–Dual Stability in Local Optimality

Much is known about when a locally optimal solution depends in a single-valued Lipschitz continuous way on the problem’s parameters, including tilt perturbations. Much less is known, however, about when that solution and a uniquely determined multiplier vector associated with it exhibit that depende...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of optimization theory and applications Ročník 203; číslo 2; s. 1325 - 1354
Hlavní autoři: Benko, Matúš, Rockafellar, R. Tyrrell
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2024
Témata:
ISSN:0022-3239, 1573-2878
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Much is known about when a locally optimal solution depends in a single-valued Lipschitz continuous way on the problem’s parameters, including tilt perturbations. Much less is known, however, about when that solution and a uniquely determined multiplier vector associated with it exhibit that dependence as a primal–dual pair. In classical nonlinear programming, such advantageous behavior is tied to the combination of the standard strong second-order sufficient condition (SSOC) for local optimality and the linear independent gradient condition (LIGC) on the active constraint gradients. But although second-order sufficient conditons have successfully been extended far beyond nonlinear programming, insights into what should replace constraint gradient independence as the extended dual counterpart have been lacking. The exact answer is provided here for a wide range of optimization problems in finite dimensions. Behind it are advances in how coderivatives and strict graphical derivatives can be deployed. New results about strong metric regularity in solving variational inequalities and generalized equations are obtained from that as well.
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-024-02467-6