Sciweavers

1092 search results - page 46 / 219
» Convex Methods for Transduction
Sort
View
OL
2007
87views more  OL 2007»
13 years 8 months ago
Proximality and Chebyshev sets
This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimens...
Jonathan M. Borwein
WCE
2007
13 years 10 months ago
A Multidimensional Bisection Method for Minimizing Function over Simplex
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
A. N. Baushev, E. Y. Morozova
SIAMIS
2010
283views more  SIAMIS 2010»
13 years 3 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
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
14 years 3 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
SIAMJO
2002
96views more  SIAMJO 2002»
13 years 8 months ago
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
We introduce a new barrier function which is not a barrier function in the usual sense: it has finite value at the boundary of the feasible region. Despite this, its iteration bou...
Y. Q. Bai, Mohamed El Ghami, Cees Roos