Sciweavers

152 search results - page 17 / 31
» Minimality in a Linear Calculus with Iteration
Sort
View
SIAMSC
2008
147views more  SIAMSC 2008»
13 years 7 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
MMAS
2010
Springer
13 years 2 months ago
A Nonlinear PDE-Based Method for Sparse Deconvolution
In this paper, we introduce a new nonlinear evolution partial differential equation for sparse deconvolution problems. The proposed PDE has the form of continuity equation that ar...
Yu Mao, Bin Dong, Stanley Osher
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 7 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
TON
2002
102views more  TON 2002»
13 years 7 months ago
A min, + system theory for constrained traffic regulation and dynamic service guarantees
By extending the system theory under the (min, +) algebra to the time-varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic ser...
Cheng-Shang Chang, Rene L. Cruz, Jean-Yves Le Boud...
CVPR
2003
IEEE
14 years 9 months ago
Kullback-Leibler Boosting
In this paper, we develop a general classification framework called Kullback-Leibler Boosting, or KLBoosting. KLBoosting has following properties. First, classification is based o...
Ce Liu, Heung-Yeung Shum