Local Reasoning for Global Convergence of Parameterized Rings

Author(s):  
Aly Farahat ◽  
Ali Ebnenasir
2014 ◽  
Vol 8 (1) ◽  
pp. 218-221 ◽  
Author(s):  
Ping Hu ◽  
Zong-yao Wang

We propose a non-monotone line search combination rule for unconstrained optimization problems, the corresponding non-monotone search algorithm is established and its global convergence can be proved. Finally, we use some numerical experiments to illustrate the new combination of non-monotone search algorithm’s effectiveness.


2021 ◽  
Vol 88 (1) ◽  
Author(s):  
Antoine Gautier ◽  
Matthias Hein ◽  
Francesco Tudisco

AbstractWe analyze the global convergence of the power iterates for the computation of a general mixed-subordinate matrix norm. We prove a new global convergence theorem for a class of entrywise nonnegative matrices that generalizes and improves a well-known results for mixed-subordinate $$\ell ^p$$ ℓ p matrix norms. In particular, exploiting the Birkoff–Hopf contraction ratio of nonnegative matrices, we obtain novel and explicit global convergence guarantees for a range of matrix norms whose computation has been recently proven to be NP-hard in the general case, including the case of mixed-subordinate norms induced by the vector norms made by the sum of different $$\ell ^p$$ ℓ p -norms of subsets of entries.


Sign in / Sign up

Export Citation Format

Share Document