On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation (Q1192138)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation |
scientific article |
Statements
On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation (English)
0 references
27 September 1992
0 references
A semi-infinite maximization problem with a quasi-convex upper semicontinuous objective function (point-valued) and linear constraints is considered. To this primal problem a dual problem is introduced and weak and strong duality theorems are provided. The results can be applied to the computation of the strong unicity constant in linear Chebyshev approximation. An algorithm to compute this constant is shown to converge and the use of it is illustrated with an example.
0 references
semi-infinite maximization
0 references
quasi-convex upper semicontinuous objective function
0 references
weak and strong duality theorems
0 references
strong unicity constant
0 references
linear Chebyshev approximation
0 references
0 references