Modified new conjugate gradient method for Unconstrained Optimization
Tikrit Journal of Pure Science, 2019 The current paper modified method of conjugate gradient for solving problems of unconstrained optimization. The modified method convergence is achieved by assuming some hypotheses.
Zeyad M. Abdullah +3 more
doaj +1 more source
Regularized Nonlinear Acceleration [PDF]
, 2018 We describe a convergence acceleration technique for unconstrained optimization problems. Our scheme computes estimates of the optimum from a nonlinear average of the iterates produced by any optimization method.
Bach, Francis +2 more
core +5 more sources
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
Necessary and sufficient condition on global optimality without convexity and second order differentiability [PDF]
, 2012 The main goal of this paper is to give a necessary and sufficient condition of global optimality for unconstrained optimization problems, when the objective function is not necessarily convex. We use Gâteaux differentiability of the objective function
A. Brøndsted +9 more
core +1 more source
Unconstrained salient object detection via proposal subset optimization [PDF]
, 2016 We aim at detecting salient objects in unconstrained images. In unconstrained images, the number of salient objects (if any) varies from image to image, and is not given. We present a salient object detection system that directly outputs a compact set of
Lin, Zhe +5 more
core +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
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