On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation
DOI10.1016/0022-247X(92)90151-3zbMATH Open0756.49017OpenAlexW2066431136MaRDI QIDQ1192138FDOQ1192138
Authors: Thomas Fischer 
Publication date: 27 September 1992
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(92)90151-3
Recommendations
weak and strong duality theoremsstrong unicity constantlinear Chebyshev approximationquasi-convex upper semicontinuous objective functionsemi-infinite maximization
Nonconvex programming, global optimization (90C26) Best approximation, Chebyshev systems (41A50) Duality theory (optimization) (49N15)
Cites Work
- Title not available (Why is that?)
- An algorithm for determining all extreme points of a convex polytope
- On the global minimization of concave functions
- A method for globally minimizing concave functions over convex sets
- Uniqueness and Differential Characterization of Approximations from Manifolds of Functions
- Characterizations of strong unicity in approximation theory
- On the global minimum of a quasi-concave functional
- A general theory of dual optimization problems
- Lipschitz conditions on uniform approximation operators
- On Poreda's problem on the strong unicity constants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong unicity and alternation for linear optimization
- A refinement of an optimality criterion and its application to parametric programming
- Lipschitz and strong unicity constants for changing dimension
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1192138)
