Sciweavers

697 search results - page 19 / 140
» Convex Functions on Discrete Sets
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
Distributed subgradient projection algorithm for convex optimization
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
AUTOMATICA
2008
98views more  AUTOMATICA 2008»
13 years 9 months ago
An algorithm for bounded-error identification of nonlinear systems based on DC functions
This paper presents a guaranteed method for the parameter estimation of nonlinear models in a bounded-error context. This method is based on functions which consists of the differ...
J. M. Bravo, T. Alamo, M. J. Redondo, Eduardo F. C...
NIPS
2001
13 years 10 months ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan
COMPGEOM
2001
ACM
14 years 17 days ago
Balanced lines, halving triangles, and the generalized lower bound theorem
A recent result by Pach and Pinchasi on so-called balanced lines of a finite two-colored point set in the plane is related to other facts on halving triangles in 3-space and to a ...
Micha Sharir, Emo Welzl
COMPIMAGE
2010
Springer
14 years 3 months ago
Curvature Estimation for Discrete Curves Based on Auto-adaptive Masks of Convolution
We propose a method that we call auto-adaptive convolution which extends the classical notion of convolution in pictures analysis to function analysis on a discrete set. We define...
Christophe Fiorio, Christian Mercat, Fréd&e...