Strong unicity and alternation for linear optimization

DOI10.1007/BF00940642zbMath0702.90086MaRDI QIDQ915659

Thomas Fischer

Publication date: 1991

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

alternationlinear semi-infinite optimizationstrong unicitybest Chebyshev approximationHaar's theorem

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Semi-infinite programming (90C34) Uniqueness of best approximation (41A52)

Related Items (5)

Strong unicity in normed linear spaces ⋮ Optimality theory for semi-infinite linear programming^∗ ⋮ First order solutions in conic programming ⋮ Generalized polarity and weakest constraint qualifications in multiobjective optimization ⋮ On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation

Cites Work

• A refinement of an optimality criterion and its application to parametric programming
• Characterizations of strong unicity in approximation theory
• Some theorems on Cebysev approximation
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• Global unicity in semi-infinite optimization
• A Unified Approach to Certain Problems of Approximation and Minimization
• A local version of haar's theorem in approximation theory
• An Infinite Linear Program with a Duality Gap
• Uniqueness and Differential Characterization of Approximations from Manifolds of Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong unicity and alternation for linear optimization