Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data

DOI10.1137/110857738zbMATH Open1266.49027OpenAlexW2069374819MaRDI QIDQ5300532FDOQ5300532

T. 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

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

zbMATH Keywords

optimizationsemi-infinite programmingvariational analysisinfinite programmingsupremum functions

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Semi-infinite programming (90C34)

Cited In (44)

• Title not available (Why is that?)
• Optimality conditions for semi-infinite programming problems involving generalized convexity
• Robustness in nonsmooth nonconvex optimization problems
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
• Bilevel Optimization and Variational Analysis
• Formulae for the conjugate and the subdifferential of the supremum function
• Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming
• Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
• Variational analysis based on proximal subdifferential on smooth Banach spaces
• Some new optimality conditions for semivector bilevel optimization program
• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
• Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
• Optimality and duality for robust multiobjective optimization problems
• Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming
• Estimates for coderivative of solution map in bilevel program
• Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
• Title not available (Why is that?)
• Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
• 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
• Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints
• 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
• Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
• Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions
• Conjugation-based approach to the \(\varepsilon\)-subdifferential of convex suprema
• Applying convexificators in robust multiobjective optimization
• Integral-type representations for the subdifferential of suprema
• Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
• Necessary conditions in infinite-horizon control problems that need no asymptotic assumptions
• Lipschitz continuity of the \(\varepsilon\)-subdifferential and nonmonotonic methods with averaging of \(\varepsilon\)-subgradients for nonsmooth optimization
• Valadier-like formulas for the supremum function II: The compactly indexed case
• 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
• New extremal principles with applications to stochastic and semi-infinite programming
• A nondegenerate fuzzy optimality condition for constrained optimization problems without qualification conditions
• Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
• 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
• Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
• Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
• On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data

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)