Subsmooth semi-infinite and infinite optimization problems
From MaRDI portal
Recommendations
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Moreau-Rockafellar-type formulas for the subdifferential of the supremum function
- Nonsmooth semi-infinite programming problem using limiting subdifferentials
Cites work
- scientific article; zbMATH DE number 1186920 (Why is no real title available?)
- scientific article; zbMATH DE number 3791103 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 823375 (Why is no real title available?)
- A formula for the set of optimal solutions of a relaxed minimization problem. Applications to subdifferential calculus
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Bi-level strategies in semi-infinite programming.
- Calmness of constraint systems with applications
- Error bounds in mathematical programming
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Global unicity in semi-infinite optimization
- Global weak sharp minima for convex (semi-)infinite optimization problems
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Optimization and nonsmooth analysis
- Penalty and smoothing methods for convex semi-infinite programming
- Prox-regular functions in variational analysis
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming. Recent advances
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- Strong uniqueness in sequential linear programming
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Subsmooth sets: Functional characterizations and related concepts
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- Weak sharp minima revisited. I: Basic theory
Cited in
(18)- Stability of error bounds for conic subsmooth inequalities
- The equivalence of three types of error bounds for weakly and approximately convex functions
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- Slater Condition for Tangent Derivatives
- Optimality and duality for robust multiobjective optimization problems
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- Applying convexificators in robust multiobjective optimization
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- scientific article; zbMATH DE number 4108541 (Why is no real title available?)
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Valadier-like formulas for the supremum function II: The compactly indexed case
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
This page was built for publication: Subsmooth semi-infinite and infinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715070)
