Semi-infinite optimization under convex function perturbations: Lipschitz stability (Q535062): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and Well-Posedness in Linear Semi-Infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz Continuity of the Optimal Value via Bounds on the Optimal Set in Linear Semi-Infinite Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the compactness of the index set in convex optimization. Application to metric regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Lipschitz property of linear semi-infinite vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of semi-infinite vector optimization problems under functional perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuity properties in semi-infinite parametric linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Farkas-type constraint qualifications in convex infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability Theory for Linear Inequality Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-infinite programming. Workshop, Cottbus, Germany, September 1996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of optimal solution sets of convex infinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Latest revision as of 01:35, 4 July 2024

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
    0 references
    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
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references