Scalable Proximal Jacobian Iteration Method With Global Convergence Analysis for Nonconvex Unconstrained Composite Optimizations

2019 ◽  
Vol 30 (9) ◽  
pp. 2825-2839 ◽  
Author(s):  
Hengmin Zhang ◽  
Jianjun Qian ◽  
Junbin Gao ◽  
Jian Yang ◽  
Chunyan Xu
Keyword(s):  
Global Convergence ◽  
Convergence Analysis ◽  
Iteration Method ◽  
Global Convergence Analysis

Global convergence analysis for the NIC flow

2001 ◽  
Vol 49 (10) ◽  
pp. 2422-2430 ◽  
Author(s):  
Wanquan Liu ◽  
Wei-Yong Yan ◽  
V. Sreeram ◽  
Kok Lay Tao
Keyword(s):  
Global Convergence ◽  
Convergence Analysis ◽  
Global Convergence Analysis

scholarly journals On the Theoretical Analysis of the Plant Propagation Algorithms

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Muhammad Sulaiman ◽  
Abdellah Salhi ◽  
Asfandyar Khan ◽  
Shakoor Muhammad ◽  
Wali Khan
Keyword(s):  
Global Convergence ◽  
Theoretical Analysis ◽  
Convergence Analysis ◽  
Benchmark Problems ◽  
Search Problem ◽  
Plant Propagation ◽  
Growing Body ◽  
Global Convergence Analysis ◽  
Theoretical Insight ◽  
Insight Into

Plant Propagation Algorithms (PPA) are powerful and flexible solvers for optimisation problems. They are nature-inspired heuristics which can be applied to any optimisation/search problem. There is a growing body of research, mainly experimental, on PPA in the literature. Little, however, has been done on the theoretical front. Given the prominence this algorithm is gaining in terms of performance on benchmark problems as well as practical ones, some theoretical insight into its convergence is needed. The current paper is aimed at fulfilling this by providing a sketch for a global convergence analysis.

Sign in / Sign up

Export Citation Format

Share Document