Sciweavers

306 search results - page 21 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
SIAMIS
2010
283views more  SIAMIS 2010»
13 years 2 months ago
A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...
Ernie Esser, Xiaoqun Zhang, Tony F. Chan
SIAMJO
2002
159views more  SIAMJO 2002»
13 years 7 months ago
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
Yun-Bin Zhao, Duan Li
SIAMSC
2010
215views more  SIAMSC 2010»
13 years 5 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 8 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
WALCOM
2007
IEEE
151views Algorithms» more  WALCOM 2007»
13 years 8 months ago
Base Station Placement Problem on the Boundary of a Convex Region
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...