Sciweavers

97 search results - page 7 / 20
» A Second Derivative SQP Method: Global Convergence
Sort
View
JGO
2010
112views more  JGO 2010»
13 years 7 months ago
An information global minimization algorithm using the local improvement technique
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
Daniela Lera, Yaroslav D. Sergeyev
CGF
1999
79views more  CGF 1999»
13 years 8 months ago
Stochastic Iteration for Non-diffuse Global Illumination
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
László Szirmay-Kalos
SIAMJO
2002
115views more  SIAMJO 2002»
13 years 8 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov
CVPR
2009
IEEE
15 years 4 months ago
Global Active Contour-based Image Segmentation via Probability Alignment
Active contours is a popular technique for image segmentation. However, active contour tend to converge to the closest local minimum of its energy function and often requires a ...
Andriy Myronenko, Xubo B. Song
SIAMSC
2010
134views more  SIAMSC 2010»
13 years 7 months ago
Moving Least Squares via Orthogonal Polynomials
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
Michael Carley