The conjugate gradient method plays an important role in solving large-scaled problems and the quasi-Newton method is known as the most efficient method in solving unconstrained optimization problems. Therefore, in this paper, the new hybrid 2592 Mohd Asrul Hery Ibrahim et al. method between the conjugate gradient method and the quasi-newton method for solving optimization problem is suggested....

In modeling and location analysis, most traditional fault location methods do not consider about the existence of practical nonlinear model in distribution network, such as the nonlinearity of load and grounding resistor. Hence, the adopted model can’t express the practical network, and the location results will lose practical meaning. Aiming at solving the question above, this paper proposes a...

In this paper we propose an iterative learning control scheme based on the quasi-Newton method. The iterative learning control is designed to improve the performance of the systems working cyclically. We consider the general type of systems described by continuously diierentiable operator acting in Banach spaces. The suucient conditions for the convergence of quasi-Newton iterative learning alg...

A generalization of Isakov's theorem ((13]) to admissible shapes that include screens with a Robin boundary condition (in which the impedance is also an unknown) is presented. We also establish a characterization that enables us to distinguish the far-eld of plane screens from others. Numerical results using a quasi-Newton method are presented.

This paper proposes a new predictor-corrector interior-point method for a class of semidefinite programs, which numerically traces the central trajectory in a space of Lagrange multipliers. The distinguished features of the method are full use of the BFGS quasi-Newton method in the corrector procedure and an application of the conjugate gradient method with an effective preconditioning matrix i...

This paper proposes a new primal-dual predictor-corrector interior-point method for a class of semideenite programs, which numerically traces the central trajectory in a space of Lagrange multipliers. The distinguishing features of the method are full use of the BFGS quasi-Newton method in the corrector procedure and an application of the conjugate gradient method with an eeective preconditioni...

Quasi-Newton methods based on least change secant updating formulas that solve linear equations Ax = b in n = dim(x) = dim(b) steps can be expected to solve corresponding smooth nonlinear systems n-step quadratically, i.e. with an r-order of ρ = 2 = 1 + 1/n+O(1/n). The best rate one can possibly expect on general problems is given by the positive root ρn of ρ (ρ− 1) = 1, for which ρn − 1 = ln(n...

We compare the performance of several robust large-scale minimization algorithms applied for the minimization of the cost functional in the solution of ill-posed inverse problems related to parameter estimation applied to the parabolized Navier-Stokes equations. The methods compared consist of the conjugate gradient method (CG), Quasi-Newton (BFGS), the limited memory Quasi-Newton (L-BFGS) [1],...

The paper presents concrete realizations of quasi-Newton methods for solving several standard problems including complementarity problems, special variational inequality problems, and the Karush–Kuhn–Tucker (KKT) system of nonlinear programming. A new approximation idea is introduced in this paper. The Q-superlinear convergence of the Newton method and the quasiNewton method are established und...