Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
From MaRDI portal
Publication:5300532
Recommendations
- Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings
- Subdifferential of the supremum via compactification of the index set
- Moreau-Rockafellar-type formulas for the subdifferential of the supremum function
- Non-convex semi-infinite min-max optimization with noncompact sets
- New differential properties of sup-type functions
Cited in
(47)- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
- Formulae for the conjugate and the subdifferential of the supremum function
- New extremal principles with applications to stochastic and semi-infinite programming
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- On formulae for the Ioffe geometric subdifferential of a supremum function
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Robustness in nonsmooth nonconvex optimization problems
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- A nondegenerate fuzzy optimality condition for constrained optimization problems without qualification conditions
- Necessary conditions in infinite-horizon control problems that need no asymptotic assumptions
- Optimality and duality for robust multiobjective optimization problems
- Conjugation-based approach to the \(\varepsilon\)-subdifferential of convex suprema
- Subdifferential formulae for the supremum of an arbitrary family of functions
- Integral-type representations for the subdifferential of suprema
- Subdifferential of the supremum via compactification of the index set
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- Applying convexificators in robust multiobjective optimization
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- Some new optimality conditions for semivector bilevel optimization program
- Bilevel optimization and variational analysis
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Lipschitz continuity of the \(\varepsilon\)-subdifferential and nonmonotonic methods with averaging of \(\varepsilon\)-subgradients for nonsmooth optimization
- Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Subsmooth semi-infinite and infinite optimization problems
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- Estimates for coderivative of solution map in bilevel program
- Variational analysis based on proximal subdifferential on smooth Banach spaces
- Valadier-like formulas for the supremum function II: The compactly indexed case
- Generalized differentiation of probability functions acting on an infinite system of constraints
- Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Non-convex semi-infinite min-max optimization with noncompact sets
- Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
This page was built for publication: Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300532)
