Unconstrained optimization problems
A Conjugate Gradient Method for Unconstrained Optimization Problems
... A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient ...
14
Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems Pages 19-34 Download PDF
... powerful optimization algorithm is proposed in this paper for solving the constrained and unconstrained optimization ...benchmark problems. In addition to solving the constrained benchmark ...
16
New Variants of Newton’s Method for Nonlinear Unconstrained Optimization Problems
... In this paper, we propose new variants of Newton’s method based on quadrature formula and power mean for solving nonlinear unconstrained optimization problems. It is proved that the order of ...
6
A New Non monotone Adaptive Trust Region Method for Unconstrained Optimization Problems
... new non-monotone adaptive trust region method f or unconstrained optimization problems. Actually, we combined a new strategy of non-monotone line search with the ratio of actual reduction and the ...
7
An adaptive nonmonotone trust region method for unconstrained optimization problems based on a simple subproblem
... The advantages of nonmonotone and adaptive techniques have been simulta- neously employed in the framework of trust region methods. Using the adap- tive strategy proposed in [15], Sang et al. in [20] introduced a ...
24
A conjugate gradient algorithm for large scale unconstrained optimization problems and nonlinear equations
... The optimization model is an important mathematic problem since it has been applied to various fields such as economics, engineering, and physics (see ...large-scale unconstrained optimization ...
19
The modified BFGS method with new secant relation for unconstrained optimization problems
... Abstract Using Taylor’s series we propose a modified secant relation to get a more accurate approximation of the second curvature of the objective function. Then, based on this modified secant relation we present a new ...
14
On the Global Convergence of the PERRY SHANNO Method for Nonconvex Unconstrained Optimization Problems
... test problems and S the number of elements in S ...few problems for which the me- thod requires a great deal of function evaluations and gradient ...
6
7. A Modification of Quasi-Newton (DFP) Method for Solving Unconstrained Optimization Problems
... nonlinear problems (classical test function) with different function all programs are written in FORTRAN 95 language and for all cases the stopping condition ...
11
A Non Monotone Trust Region Method with Non Monotone Wolfe Type Line Search Strategy for Unconstrained Optimization
... In this paper, we propose and analyze a non-monotone trust region method with non-monotone line search strategy for unconstrained optimization problems. Unlike the traditional non-mono- tone trust ...
6
Global convergence of a modified conjugate gradient method
... In this section, we compare the performance of Algorithm . with those of the PRP+ method [] and the CG-DESCENT method [] in the number of function evaluations and CPU time in seconds with the strong Wolfe line ...
12
Structural optimization: an approach based on genetic algorithms and parallel computing
... for unconstrained optimization problems but constrained optimization problems can be reduced to the unconstrained case simply by matching with a penalty or augmented lagrangian ...
170
Minimization of Unconstrained Nonpolynomial Large-Scale Optimization Problems Using Conjugate Gradient Method Via Exact Line Search
... the optimization process of the said set of functions considered, the study reveals that adopting the line search technique gives good results when applied to some of the non-polynomial unconstrained ...
5
Stability issues of finite precision controller structures for sampled data systems
... new optimization method for the optimal realization of ® nite-precision controller ...constrained optimization can be decoupled into two unconstrained optimization problems, which ...
13
Gravitational Swarm Optimizer for Global Optimization
... solve unconstrained optimization ...Swarm Optimization (PSO) [7, 28, 44], Di ff erential Evolution (DE) [5, 33, 8], and the Gravitational Search Algorithm (GSA) [45] are known to deliver excellent ...
65
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
Vol 3, No 12 (2012)
... solve unconstrained nonlinear minimization problems arising in the diversified field of engineering and technology, we have several methods to get ...solving unconstrained optimization ...
6
Vol 3, No 5 (2012)
... Recently, the authors introduced a new three-terms nonlinear Conjugate Gradient (CG) method [2] for solving unconstrained optimization problems. Their method was compared with the well-known Zhang's ...
12
A Modified Family Of Cg-Algorithm With A New Closed-Form Line-Search Procedure
... nonlinear unconstrained optimization problems proposed by (Dia&Yuan,1998); (Al-Bayati and Ahmed, 2005) and (Al-Bayati and Metras, 2008) respectively by employing a new closed-form step-size ...
7
A hybrid conjugate gradient method for optimization problems
... is satisfied, where 1.0 5. D All the codes were written in Fortran and run on PC with 2.60 GHz CPU processor and 256 MB memory and Windows XP op- eration system. In the experiments, the parameters were chosen as ...
6