Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
From MaRDI portal
Publication:5300532
DOI10.1137/110857738zbMath1266.49027OpenAlexW2069374819MaRDI QIDQ5300532
Tran T. A. Nghia, Boris S. Mordukhovich
Publication date: 27 June 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110857738
Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Semi-infinite programming (90C34)
Related Items
Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications ⋮ Some new optimality conditions for semivector bilevel optimization program ⋮ Robustness in nonsmooth nonconvex optimization problems ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces ⋮ Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Applying convexificators in robust multiobjective optimization ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ Variational analysis based on proximal subdifferential on smooth Banach spaces ⋮ Necessary conditions in infinite-horizon control problems that need no asymptotic assumptions ⋮ Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints ⋮ Estimates for coderivative of solution map in bilevel program ⋮ Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty ⋮ 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 ⋮ Conjugation-based approach to the \(\varepsilon\)-subdifferential of convex suprema ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ Formulae for the conjugate and the subdifferential of the supremum function ⋮ Optimality conditions for semi-infinite programming problems involving generalized convexity ⋮ Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function ⋮ Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings ⋮ New extremal principles with applications to stochastic and semi-infinite programming ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Unnamed Item ⋮ A nondegenerate fuzzy optimality condition for constrained optimization problems without qualification conditions ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ Optimality and duality for robust multiobjective optimization problems ⋮ Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings ⋮ Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data ⋮ Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Unnamed Item ⋮ Valadier-like formulas for the supremum function II: The compactly indexed case ⋮ Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials ⋮ Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints ⋮ Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming ⋮ Bilevel Optimization and Variational Analysis
