Revisiting some rules of convex analysis (Q683299): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the closedness of the algebraic difference of closed convex sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3784617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-valued analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for zero duality gap in convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3654591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational methods in convex analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower semicontinuous type regularity conditions for subdifferential calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Moreau–Rockafellar results for composed convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3628086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative formulation for a new closed cone constraint qualification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Subdifferential of the Supremum of Two Convex Functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple closure condition for the normal cone intersection formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new geometric condition for Fenchel's duality in infinite dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for stable conjugate duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and measurable multifunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weaker conditions for subdifferential calculus of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel duality and the strong conical hull intersection property / 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: Q3425534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Lagrangian conditions for convex programs with applications to semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A closedness condition and its applications to DC programs with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New glimpses on convex infinite optimization duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdifferential calculus using \(\varepsilon\)-subdifferentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4767789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform duality in semi-infinite convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint qualifications characterizing Lagrangian duality in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3422502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for semi-definite and semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Closedness of the Linear Image of a Closed Convex Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regularity conditions in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculus Without Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis. From concepts to applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4881711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2953996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on d-stability of convex programs and limiting Lagrangians / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of constraint qualifications in infinite-dimensional convex programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality gap in linear conic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Zero Duality Gap and the Farkas Lemma for Conic Programming / rank
 
Normal rank

Latest revision as of 01:31, 15 July 2024

scientific article
Language Label Description Also known as
English
Revisiting some rules of convex analysis
scientific article

    Statements

    Revisiting some rules of convex analysis (English)
    0 references
    0 references
    6 February 2018
    0 references
    The author replaces the known global qualification conditions from convex analysis by a new approach in terms of pointwise outer semicontinuity of a conveniently defined multifunction. The rules holding without qualifications are examined after pointing some results on polar sets and conjugate functions. The geometric approach to the normal cone to the inverse image of a convex subset by a continuous linear map gives the main result of this paper. Also, new calculus rules for the subdifferential of a performance function are derived in classes of convex functions having a special composite form. The new conditions are compared with the existing ones in the literature, showing that a pointwise qualification rule derived in this paper is more efficient than a global qualification rule.
    0 references
    composition rule
    0 references
    convexity
    0 references
    normal cone
    0 references
    qualification conditions
    0 references
    regularity
    0 references
    sum rule
    0 references
    subdifferential
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references