Optimality conditions for convex problems on intersections of non necessarily convex sets (Q2173517): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4375488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions in convex optimization revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient KKT optimality conditions in non-convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions in optimization problems with convex feasible set using convexificators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Tietze–Nakajima: Local and Global Convexity for Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representations of the feasible set in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to the theory of nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Conditions for Quasiconvex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Revision as of 11:17, 22 July 2024

scientific article
Language Label Description Also known as
English
Optimality conditions for convex problems on intersections of non necessarily convex sets
scientific article

    Statements

    Optimality conditions for convex problems on intersections of non necessarily convex sets (English)
    0 references
    0 references
    0 references
    23 April 2020
    0 references
    The KKT theorem provides necessary and sufficient conditions for the global optimality of convex optimization problems under suitable regularity assumptions. In this paper, the authors consider optimization problems with sets rather than inequality constraints. They also assume that each individual set is not necessarily convex, but their intersection is. They prove a KKT-type theorem for such problems under a local convexity assumption on the defining sets. For the KKT condition's sufficiency, the objective function is assumed to be pseudoconvex in an appropriate sense. The proof of the main result relies on the use of an oriented distance instead of the classical distance, making the inequality constraints satisfy the Slater constraint qualification condition.
    0 references
    convex optimization
    0 references
    nonsmooth optimization
    0 references
    optimality conditions
    0 references

    Identifiers