On feasible sets defined through Chebyshev approximation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3837771 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 1047600 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
- On equivalent stability properties in semi-infinite optimization
- Semi-infinite optimization: Structure and stability of the feasible set
Cited in
(8)- scientific article; zbMATH DE number 7400725 (Why is no real title available?)
- Characterization of the feasible set mapping in one class of semi-infinite optimization problems.
- Linear semi-infinite programming theory: an updated survey
- 1-Determinacy of Feasible Sets
- On Proper Efficiency in Multiobjective Semi-infinite Optimization
- Approximation of maximal Cheeger sets by projection
- {\(\Gamma\)}-active constraints in convex semi-infinite programming
- A tutorial note on a convexification procedure in non-convex semi-infinite optimization
This page was built for publication: On feasible sets defined through Chebyshev approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1298746)
