A globally convergent algorithm based on imbedding and parametric optimization

Computing ◽  
1983 ◽  
Vol 30 (3) ◽  
pp. 225-252 ◽  
Author(s):  
H. Gfrerer ◽  
J. Guddat ◽  
Hj. Wacker
Keyword(s):  
Parametric Optimization ◽  
Globally Convergent ◽  
Convergent Algorithm

scholarly journals A Globally Convergent Algorithm to Compute All Nash Equilibria for n-Person Games

2005 ◽  
Vol 137 (1) ◽  
pp. 349-368 ◽  
Author(s):  
P. Jean-Jacques Herings ◽  
Ronald Peeters
Keyword(s):  
Nash Equilibria ◽  
Globally Convergent ◽  
Convergent Algorithm

An algorithm for the total, or partial, factorization of a polynomial

1977 ◽  
Vol 82 (3) ◽  
pp. 427-437 ◽  
Author(s):  
M. R. Farmer ◽  
G. Loizou
Keyword(s):  
Numerical Results ◽  
Search Procedure ◽  
Multiple Zeros ◽  
Globally Convergent ◽  
Simultaneous Iteration ◽  
Accelerate Convergence ◽  
Iteration Function ◽  
Convergent Algorithm

AbstractA globally convergent algorithm is presented for the total, or partial, factorization of a polynomial. Firstly, a circle is found containing all the zeros. Secondly, a search procedure locates smaller circles, each containing a zero, and the multiplicities are then calculated. Thirdly, a simultaneous Iteration Function is used to accelerate convergence. The Iteration Function is chosen from a class of such functions derived herein to deal with the general case of multiple zeros; various properties of these functions are also discussed. Finally, sample numerical results are given which demon-strate the effectiveness of the algorithm.

Picosecond scale experimental verification of a globally convergent algorithm for a coefficient inverse problem

2010 ◽  
Vol 26 (4) ◽  
pp. 045003 ◽  
Author(s):  
Michael V Klibanov ◽  
Michael A Fiddy ◽  
Larisa Beilina ◽  
Natee Pantong ◽  
John Schenk
Keyword(s):  
Inverse Problem ◽  
Experimental Verification ◽  
Coefficient Inverse Problem ◽  
Globally Convergent ◽  
Convergent Algorithm
Sign in / Sign up

Export Citation Format

Share Document