A dual condition for the convex subdifferential sum formula with applications
From MaRDI portal
Publication:5480077
zbMATH Open1098.49017MaRDI QIDQ5480077FDOQ5480077
Authors: R. S. Burachik, V. Jeyakumar 
Publication date: 25 July 2006
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
Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cited In (56)
- Title not available (Why is that?)
- On efficient solutions for semidefinite linear fractional vector optimization problems
- Sequential optimality theorems for second-order cone linear fractional vector optimization problems
- Variational properties of the abstract subdifferential operator
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces
- Revisiting some rules of convex analysis
- On strong and total Lagrange duality for convex optimization problems
- The conjugate of the pointwise maximum of two convex functions revisited
- A simple proof of the sum formula
- Convex sub-differential sum rule via convex semi-closed functions with applications in convex programming
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Characterizations of pointwise additivity of subdifferential
- Duality problems with second-order polyhedral discrete and differential inclusions
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Qualification conditions-free characterizations of the \(\varepsilon \)-subdifferential of convex integral functions
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Necessary and sufficient conditions for stable conjugate duality
- The stable duality of DC programs for composite convex functions
- On duality in convex optimization of second-order differential inclusions with periodic boundary conditions
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- On constraint qualifications of a nonconvex inequality
- A simple closure condition for the normal cone intersection formula
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- On optimal allocation of risk vectors
- Simple bilevel programming and extensions
- Weaker conditions for subdifferential calculus of convex functions
- New strong duality results for convex programs with separable constraints
- 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
- Towards supremum-sum subdifferential calculus free of qualification conditions
- An alternative formulation for a new closed cone constraint qualification
- New Farkas-type constraint qualifications in convex infinite programming
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- Looking for appropriate qualification conditions for subdifferential formulae and dual representations for convex risk measures
- Farkas-type results for constrained fractional programming with DC functions
- Duality for constrained robust sum optimization problems
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- Multiobjective DC programs with infinite convex constraints
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- On the existence of minimizers of proximity functions for split feasibility problems
- Variational geometric approach to generalized differential and conjugate calculi in convex analysis
- \(e^{\prime }\)-convex sets and functions: properties and characterizations
- Title not available (Why is that?)
- A splitting method for finding the resolvent of the sum of two maximal monotone operators
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions
- Liberating the subgradient optimality conditions from constraint qualifications
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)
