نتایج جستجو برای: steepest descent method

تعداد نتایج: 1645898  

2011
Iskander Aliev Adam N. Letchford

Towards optimal Newton-type methods for nonconvex smooth optimization Coralia Cartis Coralia.Cartis (at) ed.ac.uk School of Mathematics, Edinburgh University We show that the steepest-descent and Newton methods for unconstrained non-convex optimization, under standard assumptions, may both require a number of iterations and function evaluations arbitrarily close to the steepest-descent’s global...

2008
O. Oliveira P. J. Silva

An algorithm for gauge fixing to the minimal Landau gauge in lattice QCD is described. The method, a combination of an evolutionary algorithm with a steepest descent method, is able to solve the problem of the nonperturbative gauge fixing. The performance of the combined algorithm is investigated on 8, β = 5.7, and 16, β = 6.0, lattice SU(3) gauge configurations.

Journal: :journal of computer and robotics 0
mohsen jalaeian-f department of electrical engineering, center of excellence on soft computing and intelligent information processing (sciip), ferdowsi university of mashhad, mashhad, iran

augmented downhill simplex method (adsm) is introduced here, that is a heuristic combination of downhill simplex method (dsm) with random search algorithm. in fact, dsm is an interpretable nonlinear local optimization method. however, it is a local exploitation algorithm; so, it can be trapped in a local minimum. in contrast, random search is a global exploration, but less efficient. here, rand...

2008
Katrin Grunert Gerald Teschl

We apply the method of nonlinear steepest descent to compute the long-time asymptotics of the Korteweg–de Vries equation for decaying initial data in the soliton and similarity region. This paper can be viewed as an expository introduction to this method.

Journal: :IMA Journal of Numerical Analysis 2017

2015
Mohamed Kamel RIAHI

In this paper we present a new steepest-descent type algorithm for convex optimization problems. Our algorithm pieces the unknown into sub-blocs of unknowns and considers a partial optimization over each sub-bloc. In quadratic optimization, our method involves Newton technique to compute the step-lengths for the sub-blocs resulting descent directions. Our optimization method is fully parallel a...

A. Abdipour A. Anbaran A. Mohammadi

This paper proposes a new smart antenna beamforming scheme based on electronically steerable parasitic array radiator (ESPAR). The proposed method is capable of providing better capacity compared to the conventional ESPAR. The termination of each antenna element in this structure comprises a PIN diode in addition to a varactor. Using PIN diode besides the varactor provides more degrees of freed...

2008
Lu-Chuan Ceng Qamrul Hasan Ansari Jen-Chih Yao

1Department of Mathematics, Shanghai Normal University, Shanghai; and Scientific Computing Key Laboratory of Shanghai Universities, Shanghai, China 2Department of Mathematics & Statistics, College of Science, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia; and Department of Mathematics, Aligarh Muslim University, Aligarh, India 3Department of Applied Mathematics, National S...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید