Revisiting some rules of convex analysis

DOI10.1007/s11228-017-0462-3zbMath1398.90122MaRDI QIDQ683299

Jean-Paul Penot

Publication date: 6 February 2018

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-017-0462-3

zbMATH Keywords

regularity; normal cone; convexity; sum rule; subdifferential; composition rule; qualification conditions

Mathematics Subject Classification ID

90C25: Convex programming

26B25: Convexity of real functions of several variables, generalizations

26B40: Representation and superposition of functions

52A05: Convex sets without dimension restrictions (aspects of convex geometry)

49K99: Optimality conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis. From concepts to applications
• New glimpses on convex infinite optimization duality
• On duality gap in linear conic problems
• A note on d-stability of convex programs and limiting Lagrangians
• Convex analysis and measurable multifunctions
• Subdifferential calculus using \(\varepsilon\)-subdifferentials
• On the closedness of the algebraic difference of closed convex sets.
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• Fenchel duality and the strong conical hull intersection property
• Constraint qualifications characterizing Lagrangian duality in convex optimization
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
• An alternative formulation for a new closed cone constraint qualification
• Necessary and sufficient conditions for stable conjugate duality
• Variational methods in convex analysis
• A new geometric condition for Fenchel's duality in infinite dimensional spaces
• Weaker conditions for subdifferential calculus of convex functions
• Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions
• Calculus Without Derivatives
• On Zero Duality Gap and the Farkas Lemma for Conic Programming
• Duality in Vector Optimization
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• Uniform duality in semi-infinite convex optimization
• A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
• Lower semicontinuous type regularity conditions for subdifferential calculus
• A closedness condition and its applications to DC programs with convex constraints
• Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
• Generalized Moreau–Rockafellar results for composed convex functions
• On regularity conditions in mathematical programming
• A comparison of constraint qualifications in infinite-dimensional convex programming revisited
• Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
• Strong Duality for Semidefinite Programming
• Duality for semi-definite and semi-infinite programming
• A simple closure condition for the normal cone intersection formula
• Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
• On the Closedness of the Linear Image of a Closed Convex Cone
• Conditions for zero duality gap in convex programming
• New Farkas-type constraint qualifications in convex infinite programming
• Convex Analysis
• On the Subdifferential of the Supremum of Two Convex Functions.
• Convexity and Variational Analysis
• Set-valued analysis