Sciweavers

5 search results - page 1 / 1
» Superlinearly Convergent Algorithms for Solving Singular Equ...
Sort
View
SIAMJO
2002
115views more  SIAMJO 2002»
13 years 5 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
MOC
2000
85views more  MOC 2000»
13 years 6 months ago
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...
Liqun Qi, Defeng Sun
AMC
2007
95views more  AMC 2007»
13 years 6 months ago
On a new class parametrized Newton-like method for semismooth equations
: An extension of some smooth parametrized Newton-like method to the semismooth case is presented in this paper. Thus, the problems due to the fact the B-differential is singular ...
Marek J. Smietanski
MP
2008
129views more  MP 2008»
13 years 6 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
SIAMJO
2002
89views more  SIAMJO 2002»
13 years 5 months ago
A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...
Stephen C. Billups, Layne T. Watson