Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
From MaRDI portal
Recommendations
Cited in
(52)- Hiriart-Urruty-Phelps-like formula for the subdifferential of integral sums
- Extremality of convex sets with some applications
- Recent contributions to linear semi-infinite optimization
- A note on optimality conditions for DC programs involving composite functions
- Recent contributions to linear semi-infinite optimization: an update
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- New results in subdifferential calculus with applications to convex optimization
- Subdifferential of the supremum via compactification of the index set
- Simple bilevel programming and extensions
- Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Sequential -subdifferential calculus for scalar and vector mappings
- Sequential optimality conditions for composed convex optimization problems
- Sequential optimality conditions for multiobjective fractional programming problems
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- Weaker conditions for subdifferential calculus of convex functions
- Sequential subdifferential for multi-composed functions via perturbation approach
- Characterizations of convex approximate subdifferential calculus in Banach spaces
- Asymptotic optimality conditions for linear semi-infinite programming
- Towards supremum-sum subdifferential calculus free of qualification conditions
- Sequential formulae for the normal cone to sublevel sets
- Sequential approximate optimality conditions for multi objective fractional programming problems via sequential approximate subdifferential calculus
- Sequential formula for subdifferential of integral sum of convex functions
- On the long time behavior of second order differential equations with asymptotically small dissipation
- Optimality theorems for convex semidefinite vector optimization problems
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Moreau-Rockafellar-type formulas for the subdifferential of the supremum function
- scientific article; zbMATH DE number 929729 (Why is no real title available?)
- Sequential Pareto subdifferential multi-composition rule and application to multiobjective minimax location problems
- Optimality conditions, approximate stationarity, and applications -- a story beyond Lipschitzness
- On formulae for the Ioffe geometric subdifferential of a supremum function
- Subdifferential formulae for the supremum of an arbitrary family of functions
- Formulas for sequential Pareto subdifferentials of the sums of vector mappings and applications to optimality conditions
- Pareto-Fenchel \({\epsilon}\)-subdifferential composition rule and \({\epsilon}\)-efficiency
- Sequential Pareto subdifferential sum rule for convex set-valued mappings and applications
- Subdifferential and conjugate calculus of integral functions with and without qualification conditions
- scientific article; zbMATH DE number 7733449 (Why is no real title available?)
- Fuzzy multiplier, sum and intersection rules in non-Lipschitzian settings: decoupling approach revisited
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- A general representation of \(\delta\)-normal sets to sublevels of convex functions
- Revisiting some rules of convex analysis
- On the regularization of the supremum function in the bidual space
- Sequential efficiency optimality conditions for robust multiobjective fractional optimization problems
- Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
- Convex regularization and subdifferential calculus
- Sequential approximate optimality conditions for a constrained convex vector minimization problem and application to multiobjective fractional programming problem
- Strong duality in infinite convex optimization
- Study of a special nonlinear problem arising in convex semi-infinite programming
- Liberating the subgradient optimality conditions from constraint qualifications
- Natural closures, natural compositions and natural sums of monotone operators
This page was built for publication: Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377391)
