Sciweavers

12 search results - page 1 / 3
» Convergence analysis of a proximal Gauss-Newton method
Sort
View
CORR
2011
Springer
206views Education» more  CORR 2011»
12 years 11 months ago
Convergence analysis of a proximal Gauss-Newton method
Abstract An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Co...
Saverio Salzo, Silvia Villa
ECCV
2006
Springer
14 years 6 months ago
Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence
We give the first complete theoretical convergence analysis for the iterative extensions of the Sturm/Triggs algorithm. We show that the simplest extension, SIESTA, converges to no...
John Oliensis, Richard Hartley
SIAMJO
2010
92views more  SIAMJO 2010»
12 years 11 months ago
Inexact Proximal Point Methods for Variational Inequality Problems
We present a new family of proximal point methods for solving monotone variational inequalities. Our algorithm has a relative error tolerance criterion in solving the proximal subp...
Regina Sandra Burachik, Joydeep Dutta
SIAMJO
2010
84views more  SIAMJO 2010»
13 years 3 months ago
A Redistributed Proximal Bundle Method for Nonconvex Optimization
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
Warren Hare, Claudia A. Sagastizábal
SIAMMA
2010
90views more  SIAMMA 2010»
12 years 11 months ago
A General Proximity Analysis of Nonlinear Subdivision Schemes
In recent work nonlinear subdivision schemes which operate on manifold-valued data have been successfully analyzed with the aid of so-called proximity conditions bounding the diffe...
Philipp Grohs