Subsmooth semi-infinite and infinite optimization problems
From MaRDI portal
Publication:715070
DOI10.1007/s10107-011-0440-8zbMath1259.90141OpenAlexW2141957455MaRDI QIDQ715070
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0440-8
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)
Related Items
Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications ⋮ Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ The equivalence of three types of error bounds for weakly and approximately convex functions ⋮ Applying convexificators in robust multiobjective optimization ⋮ Stability of error bounds for conic subsmooth inequalities ⋮ Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty ⋮ Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity ⋮ Isolated and proper efficiencies in semi-infinite vector optimization problems ⋮ Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function ⋮ Unnamed Item ⋮ Optimality and duality for robust multiobjective optimization problems ⋮ Valadier-like formulas for the supremum function II: The compactly indexed case ⋮ Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization ⋮ Slater Condition for Tangent Derivatives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global weak sharp minima for convex (semi-)infinite optimization problems
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Error bounds in mathematical programming
- Bi-level strategies in semi-infinite programming.
- Calmness of constraint systems with applications
- Weak Sharp Minima in Mathematical Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Subsmooth sets: Functional characterizations and related concepts
- Penalty and Smoothing Methods for Convex Semi-Infinite Programming
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Global unicity in semi-infinite optimization
- Strong uniqueness in sequential linear programming
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Optimization and nonsmooth analysis
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Prox-regular functions in variational analysis
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Semi-infinite programming. Recent advances
