Optimal Lipschitzian selection operator in quasi-convex optimization
Given a bounded real function f defined on a closed bounded real interval I, the problem is to find a quasi-convex function f' which minimizes the supremum of \(| f(s)-f'(s)|\) for all s in I, over the class of all quasi-convex functions f' on I. Such a nearest function f' is not unique in general. For each f, is it possible to select a nearest f' so that the selection operator \(f\to f'\) satisfies a Lipschitz condition with some constant C? If so, does there exist an operator for which C is minimum? It is shown that there exists a maximal nearest function \(\bar f\) so that the operator \(f\to f'\) is such an optimal Lipschitzian selection operator with \(C=2\).
- An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
- Another Proof that Convex Functions are Locally Lipschitz
- Complexity of approximation problems
- Lipschitz condition in minimum norm problems on bounded functions
- Quasi-convex optimization
- Seven Kinds of Convexity
- Uniform approximation by quasi-convex and convex functions
- Lipschitz condition in minimum norm problems on bounded functions
- Quasi-convex optimization
- An O(n) algorithm for least squares quasi-convex approximation
- Uniform approximation by a non-convex cone of continuous functions
- An asymptotic result for the degree of approximation by monotone polynomials
- Lipschitz selections and stability for quasiconvex programs.
- A Lipschitz selection from the set of minimizers of a nonconvex functional of the gradient1
- Best piecewise monotone uniform approximation
- Uniform approximation by quasi-convex and convex functions
This page was built for publication: Optimal Lipschitzian selection operator in quasi-convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096545)
