Efficient algorithms for approximate smooth selection

Abstract: In this paper we provide efficient algorithms for approximate

m a t h c a l C^{m} (m a t h b b R^{n}, m a t h b b R^{D}) -

selection. In particular, given a set

E

, constants

M_{0} > 0

and

0 < a u l e q a u_{m a x}

, and convex sets

K (x) s u b s e t m a t h b b R^{D}

for

x i n E

, we show that an algorithm running in

C (a u) N l o g N

steps is able to solve the smooth selection problem of selecting a point

for

x i n E

for an appropriate dilation of

K (x)

,

, and guaranteeing that a function interpolating the points

(x, y)

will be

m a t h c a l C^{m} (m a t h b b R^{n}, m a t h b b R^{D})

with norm bounded by

C M_{0}

.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Efficient algorithms for approximate smooth selection