Results 11 to 20 of about 14,349 (287)
Modifying Of Barzilai and Borwein Method for Solving Large-Scale Unconstrained Optimization Problems. [PDF]
المجلة العراقية للعلوم الاحصائية, 2007 In this paper we present a technique for computing the minimum value of an objective function in the frame of gradient descent methods based on combination of Barzilai and Borwein approximation of Hessian matrix of objective function and Lipchetz ...
Khalil K. Abbo
doaj +1 more source
Nonlinear Conjugate Gradient Methods with Wolfe Type Line Search
Abstract and Applied Analysis, 2013 Nonlinear conjugate gradient method is one of the useful methods for unconstrained optimization problems. In this paper, we consider three kinds of nonlinear conjugate gradient methods with Wolfe type line search for unstrained optimization problems ...
Yuan-Yuan Chen, Shou-Qiang Du
doaj +1 more source
An ensemble symbiosis organisms search algorithm and its application to real world problems [PDF]
Decision Science Letters, 2017 In this study, an ensemble algorithm has been proposed, called Quasi-Oppositional Symbiosis Organisms Search (QOSOS) algorithms, by incorporating the quasi-oppositional based learning (QOBL) strategy into the newly proposed Symbiosis Organisms Search ...
Sukanta Nama, Apu Kumar Saha
doaj +1 more source
Higher-Order Optimality Conditions for Degenerate Unconstrained Optimization Problems
Journal of Optimization, Differential Equations and Their Applications, 2022 In this paper necessary and sufficient conditions of a minimum for the unconstrained degenerate optimization problem are presented. These conditions generalize the well-known optimality conditions.
Viktor Zadachyn
doaj +1 more source
Global convergence properties of a Dai-Liao-type CGM for unconstrained optimization
Recent Advances in Natural SciencesA popular optimization technique called the conjugate gradient method (CGM) is renowned for its effectiveness in addressing problems involving unconstrained optimization.
Oluwaseun Biodun Onuoha
doaj +1 more source
A Class of Weighted Low Rank Approximation of the Positive Semidefinite Hankel Matrix
Journal of Applied Mathematics, 2015 We consider the weighted low rank approximation of the positive semidefinite Hankel matrix problem arising in signal processing. By using the Vandermonde representation, we firstly transform the problem into an unconstrained optimization problem and then
Jianchao Bai +3 more
doaj +1 more source
Gravitational Co-evolution and Opposition-based Optimization Algorithm [PDF]
International Journal of Computational Intelligence Systems, 2013 In this paper, a Gravitational Co-evolution and Opposition-based Optimization (GCOO) algorithm is proposed for solving unconstrained optimization problems.
Yang Lou +3 more
doaj +1 more source
Goal seeking Quadratic Unconstrained Binary Optimization
Results in Control and Optimization, 2022 The Quadratic Unconstrained Binary Optimization (QUBO) modeling and solution framework is a requirement for quantum and digital annealers. However optimality for QUBO problems of any practical size is extremely difficult to achieve.
Amit Verma, Mark Lewis
doaj +1 more source
Testing Unconstrained Optimization Software [PDF]
ACM Transactions on Mathematical Software, 1981 Much of the testing of optimization software is inadequate because the number of test functmns is small or the starting points are close to the solution. In addition, there has been too much emphasm on measurmg the efficmncy of the software and not enough on testing reliability and robustness.
More, Jorge J. +2 more
openaire +1 more source
A modified three terms PRP conjugate gradient method
Journal of Hebei University of Science and Technology, 2018 In order to effectively solve a class of large-scale unconstrained optimization problems and overcome the shortcomings of other algorithms, such as complex algorithms, large memory and computer programming difficulties, a new search direction is defined,
Songhua WANG +3 more
doaj +1 more source