Sciweavers

560 search results - page 8 / 112
» Level-set methods for convex optimization
Sort
View
MP
1998
63views more  MP 1998»
14 years 9 months ago
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
Ya. I. Alber, Alfredo N. Iusem, Mikhail V. Solodov
JSCIC
2010
231views more  JSCIC 2010»
14 years 4 months ago
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
Variational models for image segmentation have many applications, but can be slow to compute. Recently, globally convex segmentation models have been introduced which are very rel...
Tom Goldstein, Xavier Bresson, Stanley Osher
CASC
2010
Springer
151views Mathematics» more  CASC 2010»
14 years 8 months ago
Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests
Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods t...
Winfried Neun, Thomas Sturm, Stefan Vigerske
EOR
2010
160views more  EOR 2010»
14 years 9 months ago
A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
Jie Sun, Su Zhang
ICIP
2003
IEEE
15 years 11 months ago
Algorithms for stochastic approximations of curvature flows
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame...
Gozde B. Unal, Delphine Nain, G. Ben-Arous, Nahum ...