A dual condition for the convex subdifferential sum formula with applications
From MaRDI portal
Publication:5480077
Recommendations
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Conditions for zero duality gap in convex programming
- Duality for the sum of convex functions in general normed spaces
- Towards supremum-sum subdifferential calculus free of qualification conditions
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
Cited in
(57)- On efficient solutions for semidefinite linear fractional vector optimization problems
- scientific article; zbMATH DE number 7752923 (Why is no real title available?)
- Sequential optimality theorems for second-order cone linear fractional vector optimization problems
- Variational properties of the abstract subdifferential operator
- scientific article; zbMATH DE number 7546024 (Why is no real title available?)
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
- On strong and total Lagrange duality for convex optimization problems
- On the existence of minimizers of proximity functions for split feasibility problems
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- On optimal allocation of risk vectors
- Weaker conditions for subdifferential calculus of convex functions
- Duality problems with second-order polyhedral discrete and differential inclusions
- Simple bilevel programming and extensions
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- A splitting method for finding the resolvent of the sum of two maximal monotone operators
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- The conjugate of the pointwise maximum of two convex functions revisited
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- Conditions for zero duality gap in convex programming
- New strong duality results for convex programs with separable constraints
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Qualification conditions-free characterizations of the \(\varepsilon \)-subdifferential of convex integral functions
- Revisiting some rules of convex analysis
- Duality for constrained robust sum optimization problems
- The stable duality of DC programs for composite convex functions
- Towards supremum-sum subdifferential calculus free of qualification conditions
- An alternative formulation for a new closed cone constraint qualification
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions
- Farkas' lemma: three decades of generalizations for mathematical optimization
- On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces
- On constraint qualifications of a nonconvex inequality
- \(e^{\prime }\)-convex sets and functions: properties and characterizations
- New Farkas-type constraint qualifications in convex infinite programming
- A simple proof of the sum formula
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Necessary and sufficient conditions for stable conjugate duality
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- Variational geometric approach to generalized differential and conjugate calculi in convex analysis
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Looking for appropriate qualification conditions for subdifferential formulae and dual representations for convex risk measures
- Liberating the subgradient optimality conditions from constraint qualifications
- Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
- A simple closure condition for the normal cone intersection formula
- Multiobjective DC programs with infinite convex constraints
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- On duality in convex optimization of second-order differential inclusions with periodic boundary conditions
- Farkas-type results for constrained fractional programming with DC functions
- Characterizations of pointwise additivity of subdifferential
- Convex sub-differential sum rule via convex semi-closed functions with applications in convex programming
This page was built for publication: A dual condition for the convex subdifferential sum formula with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480077)
