Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
From MaRDI portal
(Redirected from 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
(55)- Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
- Subdifferential formulae for the supremum of an arbitrary family of functions
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- On Fréchet subdifferential of supremum for arbitrary family of continuous functions
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Robustness in nonsmooth nonconvex optimization problems
- Log-exponential approximation in semi-infinite programming: a variational approach
- An optimization algorithm for \(\mathcal{H}_\infty\) control of linear delay systems
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Formulae for the conjugate and the subdifferential of the supremum function
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- Variational analysis based on proximal subdifferential on smooth Banach spaces
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Some new optimality conditions for semivector bilevel optimization program
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- On one adjoint trajectory in infinite-horizon control problems
- Optimality and duality for robust multiobjective optimization problems
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
- Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming
- Estimates for coderivative of solution map in bilevel program
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
- On formulae for the Ioffe geometric subdifferential of a supremum function
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- 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
- Subsmooth semi-infinite and infinite optimization problems
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Conjugation-based approach to the -subdifferential of convex suprema
- Applying convexificators in robust multiobjective optimization
- Integral-type representations for the subdifferential of suprema
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Necessary conditions in infinite-horizon control problems that need no asymptotic assumptions
- Lipschitz continuity of the -subdifferential and nonmonotonic methods with averaging of -subgradients for nonsmooth optimization
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Non-convex semi-infinite min-max optimization with noncompact sets
- Subdifferential of the supremum via compactification of the index set
- A nondegenerate fuzzy optimality condition for constrained optimization problems without qualification conditions
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- New extremal principles with applications to stochastic and semi-infinite programming
- Robust constrained best approximation in Banach spaces
- Valadier-like formulas for the supremum function II: The compactly indexed case
- Necessary optimality conditions for strictly robust bilevel optimization problems
- Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Generalized differentiation of probability functions acting on an infinite system of constraints
- 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
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Some results on -convex functions and Fréchet -subdifferentials
- Optimality conditions and duality in nonsmooth adjustable robust optimization problems
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)
