Global weak sharp minima for convex (semi-)infinite optimization problems
From MaRDI portal
Recommendations
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- 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
- Equivalent properties of global weak sharp minima with applications
- Weak sharp minima revisited. I: Basic theory
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 4063877 (Why is no real title available?)
- 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?)
- 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 for Abstract Linear Inequality Systems
- Error bounds for set inclusions
- Error bounds in mathematical programming
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Global error bounds for convex multifunctions and applications
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- On the Calmness of a Class of Multifunctions
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming. Recent advances
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- 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 Conditions for Calmness of Convex Constraints
- Variational Analysis
- 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
(9)- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Equivalent properties of global weak sharp minima with applications
- Global weak sharp minima and completeness of metric space
- Subsmooth semi-infinite and infinite optimization problems
- Generalized weak sharp minima in cone-constrained convex optimization with applications
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- Estimates of error bounds for some sets of efficient solutions of a set-valued optimization problem
- Generalized weak sharp minima and the existence of strong Lagrangian multipliers in conic convex optimization
This page was built for publication: Global weak sharp minima for convex (semi-)infinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950495)
