A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization.
Liu, Hailin, Cheng, Sui Sun, Li, Xiaoyong (2011)
Applied Mathematics E-Notes [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint”
A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization.
An Algorithm for Optimization
Nada I. Đuranović-Miličić (2005)
The Yugoslav Journal of Operations Research
Similarity:
A conjugate gradient method for unconstrained optimization problems.
Yuan, Gonglin (2009)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A new nonmonotone adaptive trust region algorithm
Ahmad Kamandi, Keyvan Amini (2022)
Applications of Mathematics
Similarity:
We propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstrained optimization problems. This algorithm incorporates two novelties: it benefits from a radius dependent shrinkage parameter for adjusting the trust region radius that avoids undesirable directions and exploits a new strategy to prevent sudden increments of objective function values in nonmonotone trust region techniques. Global convergence of this algorithm is investigated under some mild...
A Modified Step-Length Algorithm in Nonlinear Programming
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity:
Finding global minima with a filled function approach for non-smooth global optimization.
Wang, Weixiang, Shang, Youlin, Zhang, Ying (2010)
Discrete Dynamics in Nature and Society
Similarity:
Global optimization for sum of linear ratios problem using new pruning technique.
Jiao, Hongwei, Feng, Qigao, Shen, Peiping, Guo, Yunrui (2008)
Mathematical Problems in Engineering
Similarity:
Parallelization of artificial immune systems using a massive parallel approach via modern GPUs
Khun, Jiří, Šimeček, Ivan
Similarity:
Parallelization is one of possible approaches for obtaining better results in terms of algorithm performance and overcome the limits of the sequential computation. In this paper, we present a study of parallelization of the opt-aiNet algorithm which comes from Artificial Immune Systems, one part of large family of population based algorithms inspired by nature. The opt-aiNet algorithm is based on an immune network theory which incorporates knowledge about mammalian immune systems in...