Results 1  10
of
18,705
Optimal approximation by piecewise smooth functions and associated variational problems
 Commun. Pure Applied Mathematics
, 1989
"... (Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Mumford, David Bryant, and Jayant Shah. 1989. Optimal approximations by piecewise smooth functions and associated variational problems. ..."
Abstract

Cited by 1294 (14 self)
 Add to MetaCart
(Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Mumford, David Bryant, and Jayant Shah. 1989. Optimal approximations by piecewise smooth functions and associated variational problems
Smooth minimization of nonsmooth functions
 Math. Programming
, 2005
"... In this paper we propose a new approach for constructing efficient schemes for nonsmooth convex optimization. It is based on a special smoothing technique, which can be applied to the functions with explicit maxstructure. Our approach can be considered as an alternative to blackbox minimization. F ..."
Abstract

Cited by 523 (1 self)
 Add to MetaCart
In this paper we propose a new approach for constructing efficient schemes for nonsmooth convex optimization. It is based on a special smoothing technique, which can be applied to the functions with explicit maxstructure. Our approach can be considered as an alternative to blackbox minimization
Approximation of partially smooth functions
 PROCEEDINGS OF QIKENG LU CONFERENCE, JUNE 2006, SCIENCE IN CHINA (SER A
, 2007
"... In this paper we discuss approximation of partially smooth functions by smooth functions. This problem arises naturally in the study of laminated currents. ..."
Abstract
 Add to MetaCart
In this paper we discuss approximation of partially smooth functions by smooth functions. This problem arises naturally in the study of laminated currents.
Adapting to unknown smoothness via wavelet shrinkage
 JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
, 1995
"... We attempt to recover a function of unknown smoothness from noisy, sampled data. We introduce a procedure, SureShrink, which suppresses noise by thresholding the empirical wavelet coefficients. The thresholding is adaptive: a threshold level is assigned to each dyadic resolution level by the princip ..."
Abstract

Cited by 1006 (18 self)
 Add to MetaCart
We attempt to recover a function of unknown smoothness from noisy, sampled data. We introduce a procedure, SureShrink, which suppresses noise by thresholding the empirical wavelet coefficients. The thresholding is adaptive: a threshold level is assigned to each dyadic resolution level
Projection Pursuit Regression
 Journal of the American Statistical Association
, 1981
"... A new method for nonparametric multiple regression is presented. The procedure models the regression surface as a sum of general smooth functions of linear combinations of the predictor variables in an iterative manner. It is more general than standard stepwise and stagewise regression procedures, ..."
Abstract

Cited by 550 (6 self)
 Add to MetaCart
A new method for nonparametric multiple regression is presented. The procedure models the regression surface as a sum of general smooth functions of linear combinations of the predictor variables in an iterative manner. It is more general than standard stepwise and stagewise regression procedures
Mixed optimization for smooth functions
 In Neural Information Processing Systems (NIPS
, 2013
"... Abstract It is well known that the optimal convergence rate for stochastic optimization of smooth functions is O(1/ √ T ), which is same as stochastic optimization of Lipschitz continuous convex functions. This is in contrast to optimizing smooth functions using full gradients, which yields a conve ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract It is well known that the optimal convergence rate for stochastic optimization of smooth functions is O(1/ √ T ), which is same as stochastic optimization of Lipschitz continuous convex functions. This is in contrast to optimizing smooth functions using full gradients, which yields a
ON ISOMORPHISMS OF ALGEBRAS OF SMOOTH FUNCTIONS
, 2003
"... Abstract. We show that for any smooth paracompact Hausdorff manifolds M and N, which are not necessarily second countable or connected, any isomorphism from the algebra of smooth (real or complex) functions on N to the algebra of smooth functions on M is given by composition with a unique diffeomorp ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Abstract. We show that for any smooth paracompact Hausdorff manifolds M and N, which are not necessarily second countable or connected, any isomorphism from the algebra of smooth (real or complex) functions on N to the algebra of smooth functions on M is given by composition with a unique
Reconstruction and Representation of 3D Objects with Radial Basis Functions
 Computer Graphics (SIGGRAPH ’01 Conf. Proc.), pages 67–76. ACM SIGGRAPH
, 2001
"... We use polyharmonic Radial Basis Functions (RBFs) to reconstruct smooth, manifold surfaces from pointcloud data and to repair incomplete meshes. An object's surface is defined implicitly as the zero set of an RBF fitted to the given surface data. Fast methods for fitting and evaluating RBFs al ..."
Abstract

Cited by 505 (1 self)
 Add to MetaCart
We use polyharmonic Radial Basis Functions (RBFs) to reconstruct smooth, manifold surfaces from pointcloud data and to repair incomplete meshes. An object's surface is defined implicitly as the zero set of an RBF fitted to the given surface data. Fast methods for fitting and evaluating RBFs
High Accuracy Optical Flow Estimation Based on a Theory for Warping
, 2004
"... We study an energy functional for computing optical flow that combines three assumptions: a brightness constancy assumption, a gradient constancy assumption, and a discontinuitypreserving spatiotemporal smoothness constraint. ..."
Abstract

Cited by 509 (45 self)
 Add to MetaCart
We study an energy functional for computing optical flow that combines three assumptions: a brightness constancy assumption, a gradient constancy assumption, and a discontinuitypreserving spatiotemporal smoothness constraint.
STABILIZERS AND ORBITS OF SMOOTH FUNCTIONS
, 2005
"... Abstract. Let f: Rm → R be a smooth function such that f(0) = 0. We give a condition on f when for arbitrary preserving orientation diffeomorphism φ: R → R such that φ(0) = 0 the function φ ◦ f is right equivalent to f, i.e.there exists a diffeomorphism h: Rm → Rm such that φ ◦ f = f ◦ h at 0 ∈ Rm ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
Abstract. Let f: Rm → R be a smooth function such that f(0) = 0. We give a condition on f when for arbitrary preserving orientation diffeomorphism φ: R → R such that φ(0) = 0 the function φ ◦ f is right equivalent to f, i.e.there exists a diffeomorphism h: Rm → Rm such that φ ◦ f = f ◦ h at 0
Results 1  10
of
18,705