Sciweavers

548 search results - page 53 / 110
» Optimization of Convex Risk Functions
Sort
View
SIAMIS
2011
13 years 5 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
MP
1998
108views more  MP 1998»
13 years 10 months ago
Base polytopes of series-parallel posets: Linear description and optimization
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
Rainer Schrader, Andreas S. Schulz, Georg Wambach
ICPR
2008
IEEE
14 years 11 months ago
Continuous graph cuts for prior-based object segmentation
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...
Anders Heyden, Christian Gosch, Christoph Schn&oum...
ICML
2006
IEEE
14 years 11 months ago
Deterministic annealing for semi-supervised kernel machines
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chape...
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 5 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin