Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
From MaRDI portal
Publication:4377391
DOI10.1137/S0363012995287714zbMath0891.90138OpenAlexW1974297248MaRDI QIDQ4377391
Publication date: 9 February 1998
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012995287714
subdifferentials\(\varepsilon\)-subdifferentialsequential subdifferential calculussequential Lagrange multipliers
Convex programming (90C25) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Convex functions and convex programs in convex geometry (52A41) Calculus of functions on infinite-dimensional spaces (26E15)
Related Items
Sequential \(\varepsilon\)-subdifferential calculus for scalar and vector mappings ⋮ Weaker conditions for subdifferential calculus of convex functions ⋮ Study of a special nonlinear problem arising in convex semi-infinite programming ⋮ Hiriart-Urruty-Phelps-like formula for the subdifferential of integral sums ⋮ Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential ⋮ Liberating the subgradient optimality conditions from constraint qualifications ⋮ Sequential formulae for the normal cone to sublevel sets ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness ⋮ Extremality of convex sets with some applications ⋮ Recent contributions to linear semi-infinite optimization ⋮ Sequential Pareto subdifferential sum rule for convex set-valued mappings and applications ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ Fuzzy multiplier, sum and intersection rules in non-Lipschitzian settings: decoupling approach revisited ⋮ Optimality theorems for convex semidefinite vector optimization problems ⋮ Sequential subdifferential for multi-composed functions via perturbation approach ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Unnamed Item ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Natural closures, natural compositions and natural sums of monotone operators ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function ⋮ A general representation of \(\delta\)-normal sets to sublevels of convex functions ⋮ Revisiting some rules of convex analysis ⋮ Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency ⋮ Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency ⋮ Sequential optimality conditions for composed convex optimization problems ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ Unnamed Item ⋮ Subdifferential of the supremum via compactification of the index set ⋮ Sequential Lagrangian conditions for convex programs with applications to semidefinite programming ⋮ Characterizations of convex approximate subdifferential calculus in Banach spaces ⋮ Asymptotic optimality conditions for linear semi-infinite programming ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ Simple bilevel programming and extensions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the long time behavior of second order differential equations with asymptotically small dissipation ⋮ Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions ⋮ Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ Lagrange multipliers for set-valued optimization problems associated with coderivatives
