Results 21 to 30 of about 1,840,782 (294)
Goal seeking Quadratic Unconstrained Binary Optimization
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
An alternative globalization strategy for unconstrained optimization [PDF]
We propose a new globalization strategy that can be used in unconstrained optimization algorithms to support rapid convergence from remote starting points.
Ă–ztoprak, Figen
core +1 more source
Nonlinear Conjugate Gradient Methods with Wolfe Type Line Search
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
A clustering particle swarm optimizer for dynamic optimization [PDF]
This article is posted here with permission of the IEEE - Copyright @ 2009 IEEEIn the real world, many applications are nonstationary optimization problems.
Yang, S +5 more
core +1 more source
An ensemble symbiosis organisms search algorithm and its application to real world problems [PDF]
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
Global convergence properties of a Dai-Liao-type CGM for unconstrained optimization
A 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
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
A modified three terms PRP conjugate gradient method
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
A new trust region method is presented, which combines nonmonotone line search technique, a self-adaptive update rule for the trust region radius, and the weighting technique for the ratio between the actual reduction and the predicted reduction.
Yunlong Lu +4 more
doaj +1 more source
In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization.
Q. L. Dong +4 more
doaj +1 more source

