Quasi-convex optimization

DOI10.1016/S0022-247X(86)80008-7zbMath0595.90099MaRDI QIDQ1078102

Vasant A. Ubhaya

Publication date: 1986

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

estimationcurve fittingquasi-convex functionsbest approximation by quasi-convex function

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Algorithms for approximation of functions (65D15) Mathematical programming (90C99)

Related Items (10)

Optimal Lipschitzian selection operator in quasi-convex optimization ⋮ An O(n) algorithm for least squares quasi-convex approximation ⋮ \(L_ p\) approximation by quasi-convex and convex functions ⋮ Uniform approximation by quasi-convex and convex functions ⋮ Duality and Lipschitzian selections in best approximation from nonconvex cones ⋮ Uniform approximation by a non-convex cone of continuous functions ⋮ \(L_ p\)-approximation from nonconvex subsets of special classes of functions ⋮ Best quasi-convex uniform approximation ⋮ Lipschitz condition in minimum norm problems on bounded functions ⋮ Best piecewise monotone uniform approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Determination of Chebyshev approximations by nonlinear admissible subsets
• Linear time algorithms for convex and monotone approximation
• Lipschitz condition in minimum norm problems on bounded functions
• An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
• Isotonic approximation in \(L_ s\).
• Isotone optimization. II
• Duality in approximation and conjugate cones in normed linear spaces
• Convex hull of a finite set of points in two dimensions
• Divide and conquer for linear expected time
• O(n) algorithms for discrete n-point approximation by quasi-convex functions
• An efficient algorithm for determining the convex hull of a finite planar set
• Convex hulls of finite sets of points in two and three dimensions
• Another Proof that Convex Functions are Locally Lipschitz
• Seven Kinds of Convexity
• Point Estimates of Ordinates of Concave Functions

This page was built for publication: Quasi-convex optimization