Strong unicity and alternation for linear optimization

DOI10.1007/BF00940642MaRDI QIDQ915659zbMATH OpenFDO

Authors Thomas Fischer

Publication date 1991

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

Full work available at URL https://doi.org/10.1007/BF00940642

zbMATH Keywords

alternationbest Chebyshev approximationHaar's theoremlinear semi-infinite optimizationstrong unicity

Mathematics Subject Classification ID

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

Review text

We consider linear semi-infinite optimization problems and prove characterizations for strong unicity. One of these is a weak alternation property. This result suggests to introduce regular strong unicity, which is equivalent to a stronger alternation property. The theorems are used in order to prove a Haar-type theorem for linear optimization problems. An application to best Chebyshev approximation is given.

Recommendations

• A Note on the Spectrum of the Time Structure Function
• Strong unicity in normed linear spaces
• Global unicity in semi-infinite optimization
• scientific article; zbMATH DE number 3941265
• Publication:3485403

Cites work

• A local version of haar's theorem in approximation theory
• A refinement of an optimality criterion and its application to parametric programming
• A Unified Approach to Certain Problems of Approximation and Minimization
• An Infinite Linear Program with a Duality Gap
• Characterizations of strong unicity in approximation theory
• Duality in semi-infinite programs and some works of Haar and Carathéodory
• Global unicity in semi-infinite optimization
• scientific article; zbMATH DE number 3703310 (Why is no real title available?)
• scientific article; zbMATH DE number 3755766 (Why is no real title available?)
• scientific article; zbMATH DE number 50199 (Why is no real title available?)
• scientific article; zbMATH DE number 3242353 (Why is no real title available?)
• scientific article; zbMATH DE number 3261692 (Why is no real title available?)
• Some theorems on Cebysev approximation
• Uniqueness and Differential Characterization of Approximations from Manifolds of Functions

Cited in

(9)

• On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation
• Strong unicity in normed linear spaces
• scientific article; zbMATH DE number 4157198 (Why is no real title available?)
• A Note on the Spectrum of the Time Structure Function
• Optimality theory for semi-infinite linear programming^∗
• Generalized polarity and weakest constraint qualifications in multiobjective optimization
• Strong uniqueness and alternation theorems for relative Chebyshev centers
• On the weakest constraint qualification for sharp local minimizers
• First order solutions in conic programming

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

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