Semi-infinite optimization under convex function perturbations: Lipschitz stability (Q535062): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The parametric convex semi-infinite optimization problem is considered under convex functional perturbations of the parameter defined by both the objective and the semi-infinite constraint function. In particular the stability of the solution map of this problem is investigated where the main goal of the paper is the derivation of sufficient conditions for the pseudo-Lipschitz property of that map under perturbations of both the objective function and the constraint set. The corresponding result is new also for the special case of parametric linear semi-infinite optimization. Some illustrating examples provide a deeper understanding of the results. | |||
Property / review text: The parametric convex semi-infinite optimization problem is considered under convex functional perturbations of the parameter defined by both the objective and the semi-infinite constraint function. In particular the stability of the solution map of this problem is investigated where the main goal of the paper is the derivation of sufficient conditions for the pseudo-Lipschitz property of that map under perturbations of both the objective function and the constraint set. The corresponding result is new also for the special case of parametric linear semi-infinite optimization. Some illustrating examples provide a deeper understanding of the results. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Rembert Reemtsen / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C34 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C31 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5886717 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convex optimization | |||
Property / zbMATH Keywords: convex optimization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semi-infinite programming | |||
Property / zbMATH Keywords: semi-infinite programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parametric semi-infinite programming | |||
Property / zbMATH Keywords: parametric semi-infinite programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
solution map | |||
Property / zbMATH Keywords: solution map / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Lipschitz stability | |||
Property / zbMATH Keywords: Lipschitz stability / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pseudo-Lipschitz property | |||
Property / zbMATH Keywords: pseudo-Lipschitz property / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Slater constraint qualification | |||
Property / zbMATH Keywords: Slater constraint qualification / rank | |||
Normal rank |
Revision as of 08:49, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Semi-infinite optimization under convex function perturbations: Lipschitz stability |
scientific article |
Statements
Semi-infinite optimization under convex function perturbations: Lipschitz stability (English)
0 references
11 May 2011
0 references
The parametric convex semi-infinite optimization problem is considered under convex functional perturbations of the parameter defined by both the objective and the semi-infinite constraint function. In particular the stability of the solution map of this problem is investigated where the main goal of the paper is the derivation of sufficient conditions for the pseudo-Lipschitz property of that map under perturbations of both the objective function and the constraint set. The corresponding result is new also for the special case of parametric linear semi-infinite optimization. Some illustrating examples provide a deeper understanding of the results.
0 references
convex optimization
0 references
semi-infinite programming
0 references
parametric semi-infinite programming
0 references
solution map
0 references
Lipschitz stability
0 references
pseudo-Lipschitz property
0 references
Slater constraint qualification
0 references