Global weak sharp minima for convex (semi-)infinite optimization problems
From MaRDI portal
Publication:950495
DOI10.1016/j.jmaa.2008.07.052zbMath1279.90176OpenAlexW2094066901MaRDI QIDQ950495
Publication date: 22 October 2008
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2008.07.052
Related Items
Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Bi-level strategies in semi-infinite programming.
- Error bounds for set inclusions
- Calmness of constraint systems with applications
- Global Error Bounds for Convex Multifunctions and Applications
- Weak Sharp Minima in Mathematical Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Strong uniqueness in sequential linear programming
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- Variational Analysis
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Error Bounds for Abstract Linear Inequality Systems
- Subdifferential Conditions for Calmness of Convex Constraints
- On the Calmness of a Class of Multifunctions
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Semi-infinite programming. Recent advances
