Optimal Lipschitzian selection operator in quasi-convex optimization
From MaRDI portal
Publication:1096545
DOI10.1016/0022-247X(87)90140-5zbMath0633.90071OpenAlexW1985755226MaRDI QIDQ1096545
Publication date: 1987
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(87)90140-5
Related Items (5)
An O(n) algorithm for least squares quasi-convex approximation ⋮ Uniform approximation by quasi-convex and convex functions ⋮ Uniform approximation by a non-convex cone of continuous functions ⋮ An asymptotic result for the degree of approximation by monotone polynomials ⋮ Best piecewise monotone uniform approximation
Cites Work
- 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 discrete n-point convex approximation with applications to continuous case
- Complexity of approximation problems
- Another Proof that Convex Functions are Locally Lipschitz
- Seven Kinds of Convexity
This page was built for publication: Optimal Lipschitzian selection operator in quasi-convex optimization
