464 research outputs found
A dai-liao hybrid hestenes-stiefel and fletcher-revees methods for unconstrained optimization
Some problems have no analytical solution or too difficult to solve by scientists, engineers, and mathematicians, so the development of numerical methods to obtain approximate solutions became necessary. Gradient methods are more efficient when the function to be minimized continuously in its first derivative. Therefore, this article presents a new hybrid Conjugate Gradient (CG) method to solve unconstrained optimization problems. The method requires the first-order derivatives but overcomes the steepest descent method’s shortcoming of slow convergence and needs not to save or compute the second-order derivatives needed by the Newton method. The CG update parameter is suggested from the Dai-Liao conjugacy condition as a convex combination of Hestenes-Stiefel and Fletcher-Revees algorithms by employing an optimal modulating choice parameterto avoid matrix storage. Numerical computation adopts an inexact line search to obtain the step-size that generates a decent property, showing that the algorithm is robust and efficient. The scheme converges globally under Wolfe line search, and it’s like is suitable in compressive sensing problems and M-tensor systems
On Algorithms Based on Joint Estimation of Currents and Contrast in Microwave Tomography
This paper deals with improvements to the contrast source inversion method
which is widely used in microwave tomography. First, the method is reviewed and
weaknesses of both the criterion form and the optimization strategy are
underlined. Then, two new algorithms are proposed. Both of them are based on
the same criterion, similar but more robust than the one used in contrast
source inversion. The first technique keeps the main characteristics of the
contrast source inversion optimization scheme but is based on a better
exploitation of the conjugate gradient algorithm. The second technique is based
on a preconditioned conjugate gradient algorithm and performs simultaneous
updates of sets of unknowns that are normally processed sequentially. Both
techniques are shown to be more efficient than original contrast source
inversion.Comment: 12 pages, 12 figures, 5 table
A dai-liao hybrid conjugate gradient method for unconstrained optimization
One of todays’ best-performing CG methods is Dai-Liao (DL) method which depends on non-negative parameter  and conjugacy conditions for its computation. Although numerous optimal selections for the parameter were suggested, the best choice of  remains a subject of consideration. The pure conjugacy condition adopts an exact line search for numerical experiments and convergence analysis. Though, a practical mathematical experiment implies using an inexact line search to find the step size. To avoid such drawbacks, Dai and Liao substituted the earlier conjugacy condition with an extended conjugacy condition. Therefore, this paper suggests a new hybrid CG that combines the strength of Liu and Storey and Conjugate Descent CG methods by retaining a choice of Dai-Liao parameterthat is optimal. The theoretical analysis indicated that the search direction of the new CG scheme is descent and satisfies sufficient descent condition when the iterates jam under strong Wolfe line search. The algorithm is shown to converge globally using standard assumptions. The numerical experimentation of the scheme demonstrated that the proposed method is robust and promising than some known methods applying the performance profile Dolan and Mor´e on 250 unrestricted problems. Numerical assessment of the tested CG algorithms with sparse signal reconstruction and image restoration in compressive sensing problems, file restoration, image video coding and other applications. The result shows that these CG schemes are comparable and can be applied in different fields such as temperature, fire, seismic sensors, and humidity detectors in forests, using wireless sensor network techniques
Modified parameter of Dai Liao conjugacy condition of the conjugate gradient method
The conjugate gradient (CG) method is widely used for solving nonlinear
unconstrained optimization problems because it requires less memory to
implement. In this paper, we propose a new parameter of the Dai Liao conjugacy
condition of the CG method with the restart property, which depends on the
Lipschitz constant and is related to the Hestenes Stiefel method. The proposed
method satisfies the descent condition and global convergence properties for
convex and non-convex functions. In the numerical experiment, we compare the
new method with CG_Descent using more than 200 functions from the CUTEst
library. The comparison results show that the new method outperforms CG Descent
in terms of CPU time, number of iterations, number of gradient evaluations, and
number of function evaluations.Comment: 20 Pages, 4 figure
A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems
The conjugate gradient (CG) method has played a special role in solving large-scale nonlinear
optimization problems due to the simplicity of their very low memory requirements. This paper
proposes a conjugate gradient method which is similar to Dai-Liao conjugate gradient method (Dai and Liao, 2001)
but has stronger convergence properties. The given method possesses the sufficient descent condition,
and is globally convergent under strong Wolfe-Powell (SWP) line search for general function. Our
numerical results show that the proposed method is very efficient for the test problems
Improved Fletcher-Reeves Methods Based on New Scaling Techniques
This paper introduces a scaling parameter to the Fletcher-Reeves (FR) nonlinear conjugate gradient method. The main aim is to improve its theoretical and numerical properties when applied with inexact line searches to unconstrained optimization problems. We show that the sufficient descent and global convergence properties of Al-Baali for the FR method with a fairly accurate line search are maintained. We also consider the possibility of extending this result to less accurate line search for appropriate values of the scaling parameter. The reported numerical results show that several values for the proposed scaling parameter improve the performance of the FR method significantly
- …