Revisiting some rules of convex analysis
From MaRDI portal
Publication:683299
DOI10.1007/S11228-017-0462-3zbMATH Open1398.90122OpenAlexW2773748437MaRDI QIDQ683299FDOQ683299
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
Recommendations
- scientific article; zbMATH DE number 1014808
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- scientific article; zbMATH DE number 734672
- Weaker conditions for subdifferential calculus of convex functions
- New results in subdifferential calculus with applications to convex optimization
Convex programming (90C25) Convexity of real functions of several variables, generalizations (26B25) Optimality conditions (49K99) Convex sets without dimension restrictions (aspects of convex geometry) (52A05) Representation and superposition of functions (26B40)
Cites Work
- Convex Analysis
- Convex analysis and measurable multifunctions
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- An alternative formulation for a new closed cone constraint qualification
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Calculus Without Derivatives
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Set-valued analysis
- Convex functions. Constructions, characterizations and counterexamples
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Farkas-type results and duality for DC programs with convex constraints
- A closedness condition and its applications to DC programs with convex constraints
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- A dual condition for the convex subdifferential sum formula with applications
- Analysis. From concepts to applications
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- A simple closure condition for the normal cone intersection formula
- Duality in Vector Optimization
- New Farkas-type constraint qualifications in convex infinite programming
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- On the Closedness of the Linear Image of a Closed Convex Cone
- Strong Duality for Semidefinite Programming
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Necessary and sufficient conditions for stable conjugate duality
- Uniform duality in semi-infinite convex optimization
- From linear to convex systems: consistency, Farkas' lemma and applications
- Lower semicontinuous type regularity conditions for subdifferential calculus
- Convexity and Variational Analysis
- On the closedness of the algebraic difference of closed convex sets.
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Variational methods in convex analysis
- Title not available (Why is that?)
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Title not available (Why is that?)
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Fenchel duality and the strong conical hull intersection property
- On regularity conditions in mathematical programming
- Title not available (Why is that?)
- New regularity conditions for Lagrange and Fenchel-Lagrange duality in infinite dimensional spaces
- Bounded linear regularity, strong CHIP, and CHIP are distinct properties
- Conditions for zero duality gap in convex programming
- New glimpses on convex infinite optimization duality
- Title not available (Why is that?)
- Duality for semi-definite and semi-infinite programming
- Title not available (Why is that?)
- A note on d-stability of convex programs and limiting Lagrangians
- Weaker conditions for subdifferential calculus of convex functions
- On subdifferential calculus for convex functions defined on locally convex spaces.
- Towards supremum-sum subdifferential calculus free of qualification conditions
- Title not available (Why is that?)
- A qualification free sequential Pshenichnyi-Rockafellar lemma and convex semidefinite
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Generalized Moreau–Rockafellar results for composed convex functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Subdifferential of the Supremum of Two Convex Functions.
- On duality gap in linear conic problems
Cited In (1)
This page was built for publication: Revisiting some rules of convex analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683299)
