Approximating convex functions via non-convex oracles under the relative noise model
نویسندگان
چکیده
منابع مشابه
Approximating convex functions via non-convex oracles under the relative noise model
We study succinct representations of a convex univariate function φ over a finite domain. We show how to construct a succinct representation, namely a piecewise-linear function φ̄ approximating φ when given a black box access to an L-approximation oracle φ̃ of φ (the oracle value is always within a multiplicative factor L from the true value). The piecewise linear function φ̄ has few breakpoints (...
متن کاملApproximating Convex Functions By Non-Convex Oracles Under The Relative Noise Model
We study succinct approximation of functions that have noisy oracle access. Namely, construction of a succinct representation of a function, given oracle access to an L-approximation of the function, rather than to the function itself. Specifically, we consider the question of the succinct representation of an approximation of a convex function φ that cannot be accessed directly, but only via o...
متن کاملCutting plane oracles to minimize non-smooth non-convex functions
We discuss a bundle method for non-smooth non-convex optimization programs. In the absence of convexity, a substitute for the cutting plane mechanism has to be found. We propose such a mechanism and prove convergence of our method in the sense that every accumulation point of the sequence of serious iterates is critical.
متن کاملGeometrically Relative Convex Functions
Abstract: In this paper, some new concepts of geometrically relative convex sets and relative convex functions are defined. These new classes of geometrically relative convex functions unify several known and new classes of relative convex functions such as exponential convex functions. New Hermite-Hadamard type integral inequalities are derived for these new classes of geometrically relative c...
متن کاملApproximating optimization problems over convex functions
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in H(Ω), and optimizing functionals arising from some problems in economics. In the continuous setting and assuming smoothness, the convexity constraints may be given locally by asking the Hessian matrix to be positive sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2015
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2014.12.001