On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation

DOI10.1016/0022-247X(92)90151-3zbMath0756.49017OpenAlexW2066431136MaRDI QIDQ1192138

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

zbMATH Keywords

weak and strong duality theoremsstrong unicity constantlinear Chebyshev approximationquasi-convex upper semicontinuous objective functionsemi-infinite maximization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Best approximation, Chebyshev systems (41A50) Duality theory (optimization) (49N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the global minimization of concave functions
• Strong unicity and alternation for linear optimization
• A general theory of dual optimization problems
• On Poreda's problem on the strong unicity constants
• On the global minimum of a quasi-concave functional
• A refinement of an optimality criterion and its application to parametric programming
• Characterizations of strong unicity in approximation theory
• Lipschitz conditions on uniform approximation operators
• A method for globally minimizing concave functions over convex sets
• An algorithm for determining all extreme points of a convex polytope
• Uniqueness and Differential Characterization of Approximations from Manifolds of Functions
• Lipschitz and strong unicity constants for changing dimension

This page was built for publication: On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation