Sciweavers

SIAMJO
2002
77views more  SIAMJO 2002»
13 years 4 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 4 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
MOC
1998
89views more  MOC 1998»
13 years 4 months ago
Approximation of continuous time stochastic processes by a local linearization method
This paper investigates the rate of convergence of an alternative approximation method for stochastic differential equations. The rates of convergence of the one-step and multi-st...
Isao Shoji
SIAMJO
2000
69views more  SIAMJO 2000»
13 years 4 months ago
A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
Abstract. The Josephy
Mikhail V. Solodov, Benar Fux Svaiter
MOR
2000
67views more  MOR 2000»
13 years 4 months ago
Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints
We show that an interior-pointmethodfor monotonevariationalinequalitiesexhibits superlinear convergence provided that all the standard assumptions hold except for the well-known as...
Daniel Ralph, Stephen J. Wright
CAGD
2004
74views more  CAGD 2004»
13 years 4 months ago
Discrete Laplace-Beltrami operators and their convergence
The convergence property of the discrete Laplace
Guoliang Xu
TSP
2008
151views more  TSP 2008»
13 years 4 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
TSP
2008
85views more  TSP 2008»
13 years 4 months ago
Convergence of a Class of Decentralized Beamforming Algorithms
One of the key issues in decentralized beamforming is the need to phasealign the carriers of all the sensors in the network. Recent work in this area has shown the viability of ce...
James A. Bucklew, William A. Sethares
SIAMSC
2008
165views more  SIAMSC 2008»
13 years 4 months ago
Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
Kristian Bredies, Dirk A. Lorenz
IJCV
2006
142views more  IJCV 2006»
13 years 5 months ago
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
Helmut Pottmann, Qi-Xing Huang, Yong-Liang Yang, S...