Sciweavers

30 search results - page 1 / 6
» Analysis of iterative methods for saddle point problems: a u...
Sort
View
MOC
2002
120views more  MOC 2002»
13 years 4 months ago
Analysis of iterative methods for saddle point problems: a unified approach
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cas...
Walter Zulehner
ECCV
2010
Springer
13 years 6 months ago
Fast and Exact Primal-Dual Iterations for Variational Problems in Computer Vision
The saddle point framework provides a convenient way to formulate many convex variational problems that occur in computer vision. The framework unifies a broad range of data and re...
Jan Lellmann, Dirk Breitenreicher, Christoph Schn&...
SIAMSC
2010
198views more  SIAMSC 2010»
13 years 3 months ago
Analysis of Block Parareal Preconditioners for Parabolic Optimal Control Problems
In this paper, we describe block matrix algorithms for the iterative solution of large scale linear-quadratic optimal control problems arising from the optimal control of parabolic...
Tarek P. Mathew, Marcus Sarkis, Christian E. Schae...
MICCAI
2007
Springer
14 years 5 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
CP
2005
Springer
13 years 10 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen