Strong unicity and alternation for linear optimization
From MaRDI portal
Recommendations
Cites work
- 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?)
- A Unified Approach to Certain Problems of Approximation and Minimization
- A local version of haar's theorem in approximation theory
- A refinement of an optimality criterion and its application to parametric programming
- 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
- Some theorems on Cebysev approximation
- Uniqueness and Differential Characterization of Approximations from Manifolds of Functions
Cited in
(9)- Generalized polarity and weakest constraint qualifications in multiobjective optimization
- A Note on the Spectrum of the Time Structure Function
- First order solutions in conic programming
- On the weakest constraint qualification for sharp local minimizers
- Optimality theory for semi-infinite linear programming∗
- Strong uniqueness and alternation theorems for relative Chebyshev centers
- Strong unicity in normed linear spaces
- On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation
- scientific article; zbMATH DE number 4157198 (Why is no real title available?)
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)
