Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
From MaRDI portal
Publication:3629525
DOI10.1137/070700413zbMath1163.49014MaRDI QIDQ3629525
Abderrahim Hantoute, Marco A. López, Constantin Zalinescu
Publication date: 27 May 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/75119
Related Items
Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces, Sensitivity Analysis in Applications with Deviation, Risk, Regret, and Error Measures, Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function, Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators, Nonconvex integration using ϵ-subdifferentials, Valadier-like formulas for the supremum function I, Valadier-like formulas for the supremum function II: The compactly indexed case, Unnamed Item, Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming, Convex Representatives of the Value Function and Aumann Integrals in Normed Spaces, Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions, Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming, A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation, Unnamed Item, Unnamed Item, On e-convex functions and e-subdifferentials in locally convex spaces, The use of the relative interior in integration with nonconvex data, On the subdifferential of the supremum of an arbitrary family of extended real-valued functions, New formulas for the Fenchel subdifferential of the conjugate function, On a zero duality gap result in extended monotropic programming, A general representation of \(\delta\)-normal sets to sublevels of convex functions, Revisiting some rules of convex analysis, Subsmooth semi-infinite and infinite optimization problems, Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming, Hiriart-Urruty-Phelps-like formula for the subdifferential of integral sums, A note on the Morozov principle via Lagrange duality, Formulae for the conjugate and the subdifferential of the supremum function, Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization, Stability in linear optimization and related topics. A personal tour, Subdifferential of the conjugate function in general Banach spaces, A note on subdifferentials of pointwise suprema, A primal--dual operation on sets linked with closed convex relaxation processes, Subdifferential of the supremum via compactification of the index set, Qualification conditions-free characterizations of the \(\varepsilon \)-subdifferential of convex integral functions, Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus, New tour on the subdifferential of supremum via finite sums and suprema, Marco A. López, a pioneer of continuous optimization in Spain, Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings, The \(\varepsilon\)-strategy in variational analysis: illustration with the closed convexification of a function, Non-convex semi-infinite min-max optimization with noncompact sets, Convexity and closedness in stable robust duality, Characterizations of the subdifferential of convex integral functions under qualification conditions, Characterization of Lipschitz continuous difference of convex functions, Weaker conditions for subdifferential calculus of convex functions, On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems, Characterizations of convex approximate subdifferential calculus in Banach spaces, Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions, A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
