Approximation of set-valued functions by single-valued one

DOI10.7151/DMDICO.1031zbMATH Open1039.90051OpenAlexW2316307161MaRDI QIDQ4435573FDOQ4435573

Authors: Ivan Ginchev, Armin Hoffmann 

Publication date: 17 November 2003

Published in: Discussiones Mathematicae. Differential Inclusions, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8f95b71a5c8b5e441e661f88f183a8dbae88fbfc

Recommendations

• scientific article; zbMATH DE number 1086730
• A Korovkin Type Approximation Theorem for Set-Valued Functions
• scientific article; zbMATH DE number 940667
• scientific article; zbMATH DE number 774968
• scientific article; zbMATH DE number 4173875

zbMATH Keywords

convex optimizationset-valued functionsChebyshev approximation

Mathematics Subject Classification ID

Convex programming (90C25) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Set-valued operators (47H04) Set-valued and variational analysis (49J53)

Cited In (17)

• Second order sufficient optimality conditions in vector optimization
• Condition numbers and error bounds in convex programming
• Optimality conditions for nonsmooth multiobjective optimization using Hadamard directional derivatives
• Second-order conditions in \(C^{1,1}\) constrained vector optimization
• Geoffrion type characterization of higher-order properly efficient points in vector optimization
• First-order optimality conditions in set-valued optimization
• Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
• On scalar and vector \(\ell \)-stable functions
• On second-order optimality conditions in constrained multiobjective optimization
• From scalar to vector optimization.
• Stability of properly efficient points and isolated minimizers of constrained vector optimization problems
• Title not available (Why is that?)
• An Oriented Distance Function Application to Gap Functions for Vector Variational Inequalities
• On some optimization problems in not necessarily locally convex space
• Merit functions in vector optimization
• Some remarks on the Minty vector variational principle
• Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems

This page was built for publication: Approximation of set-valued functions by single-valued one

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435573)