unconstrained optimization
New Homotopy Conjugate Gradient for Unconstrained Optimization using Hestenes- Stiefel and Conjugate Descent
... Abstract: - In this paper, we suggest a hybrid conjugate gradient method for unconstrained optimization by using homotopy formula , We calculate the parameter š½ š as ac[r] ...
6
New Variants of Newtonās Method for Nonlinear Unconstrained Optimization Problems
... The two main practical deficiencies of Newtonās method, the need for analytic derivatives and the possible failure to converge to the solutions from poor starting points are the key issues in unconstrained ...
6
Higher Order Iteration Schemes for Unconstrained Optimization
... Optimization problems are usually solved by iteration methods. The line search widely used in unconstrained optimization is a kind of iteration scheme for updating iterates. Such a scheme, by which ...
11
The modified BFGS method with new secant relation āfor unconstrained optimization problemsā
... We propose a modified secant relation to get a more accurate approximation of the sec- ond curvature of the objective function. Then, based on the proposed secant relation, we presented a modified BFGS for solving ...
14
PRP Type Direct Search Methods for Unconstrained Optimization
... Our main purpose is to construct efficient direct search methods for solving (1). We also use the frame-based template in [18], but substitute PRP+ method with some descent conjugate gradient methods to make use of the ...
7
Symmetric and Positive Definite Broyden Update for Unconstrained Optimization
... the unconstrained optimization generate a Hessian matrix satisfying each of the principal properties of this matrix (positive definite and symmetric ...
6
A nonmonotone hybrid conjugate gradient method for unconstrained optimization
... Keywords: unconstrained optimization; nonmonotone hybrid conjugate gradient algorithm; global convergence; linear convergence rate.. 1 Introduction Let us take the following unconstraine[r] ...
13
A DESCENT PRP CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
... In this section, we report some computational performances of the new algorithm on a set including 75 unconstrained optimization test problems. The test problems and initial points have been selected from ...
14
3. A New Conjugate Gradient for Nonlinear Unconstrained Optimization
... (1.3) Abstractā The conjugate gradient method is a very useful technique for solving minimization problems and has wide applications in many fields. In this paper we propose a new conjugate gradient methods by) for ...
13
A scaled three term conjugate gradient method for unconstrained optimization
... standard unconstrained optimization problem show that the proposed method is promising and exhibits a superior numerical performance in comparison with other well-known conjugate gradient ...
16
A New Descent Nonlinear Conjugate Gradient Method for Unconstrained Optimization
... ļ¢ was given to compute the search directions for unconstrained optimization problems. It was discussed some general convergence results for the proposed formula with some line searches such as the exact ...
5
Geometrically Constructed Families of Newton's Method for Unconstrained Optimization and Nonlinear Equations
... Here we consider some examples to compare the number of iterations needed in the traditional Newtonās method and its modifications, namely, 2.5, 2.7, 3.4, and 3.6 respectively, for solving nonlinear equation Table 1 and ...
10
Scaling rank-one updating formula and its application in unconstrained optimization
... It contains four charpters, and introduces basic results on unconstrained optimization, some popular methods and their properties based on quadratic approximations to the objective funct[r] ...
143
A Retrospective Filter Trust Region Algorithm for Unconstrained Optimization
... for unconstrained optimization, which is based on the framework of the retrospective trust region method and associated with the technique of the multi-dimensional ...
10
A Conjugate Gradient Method for Unconstrained Optimization Problems
... This paper gives a hybrid conjugate gradient method for solving unconstrained optimization problems. Under the SWP line search, this method possesses the suļ¬cient descent condition only with the parameter Ļ ...
14
A new accelerated conjugate gradient method for large scale unconstrained optimization
... In this paper, we present a new conjugate gradient method using an acceleration scheme for solving large-scale unconstrained optimization. The generated search direction satisļ¬es both the suļ¬cient descent ...
13
Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
... of unconstrained optimization problems from [18], which indicates the proposed method possesses better performances when compared with the classic PRP method, CG-DESCENT method and DSP-CG ...
12
A Line Search Algorithm for Unconstrained Optimization
... It is well known that the line search methods play a very important role for optimization problems. In this paper a new line search method is proposed for solving unconstrained optimization. Under ...
7
A modified nonmonotone BFGS algorithm for unconstrained optimization
... It has been proved that [ļ½ļæ] problems with initial points are an eļ¬ective tool to estimate the performance of algorithms and are one of the most commonly used sets of optimization problems. Many scholars use these ...
18
Adaptive cuckoo search algorithm for unconstrained optimization
... the optimization performances of the CSA and ACSA for Rastriginās ...the optimization process of CSA may span a longer period of time than the proposed ACSA as it makes too small and cautious steps while ...
9