On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation
From MaRDI portal
(Redirected from Publication:1192138)
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.
Recommendations
Cites work
- A general theory of dual optimization problems
- A method for globally minimizing concave functions over convex sets
- A refinement of an optimality criterion and its application to parametric programming
- An algorithm for determining all extreme points of a convex polytope
- Characterizations of strong unicity in approximation theory
- scientific article; zbMATH DE number 4021826 (Why is no real title available?)
- scientific article; zbMATH DE number 3753358 (Why is no real title available?)
- scientific article; zbMATH DE number 3535191 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- Lipschitz and strong unicity constants for changing dimension
- Lipschitz conditions on uniform approximation operators
- On Poreda's problem on the strong unicity constants
- On the global minimization of concave functions
- On the global minimum of a quasi-concave functional
- Strong unicity and alternation for linear optimization
- Uniqueness and Differential Characterization of Approximations from Manifolds of Functions
This page was built for publication: On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1192138)