scholarly journals About the estimation of the convergence rate of projection-iteration processes of conditional minimization of a functional

Author(s):  
L. L. Gart

We study projection-iterative processes based on the conditional gradient method to solve the problem of minimizing a functional in a real separable Hilbert space. To solve extremal problems, methods of approximate (projection) type are often used, which make it possible to replace the initial problem by a sequence of auxiliary approximating extremal problems. The work of many authors is devoted to the problems of approximating various classes of extremal problems. Investigations of projection and projection-iteration methods for solving extremal problems with constraints in Hilbert and reflexive Banach spaces were carried out, in particular, in the works of S.D. Balashova, in which the general conditions for approximation and convergence of sequences of exact and approximate solutions of approximating extremal problems considered both in subspaces of the original space and in certain spaces isomorphic to them were proposed. The projection-iterative approach to the approximate solution of an extremal problem is based on the possibility of applying iterative methods to the solution of approximating problems. Moreover, for each of the "approximate" extremal problems, only a few approximations are obtained with the help of a certain iteration method and the last of them as the initial approximation for the next "approximate" problem is used. This paper, in continuation of the author's past work to solve the problem of minimizing a functional on a convex set of Hilbert space, is devoted to obtaining theoretical estimates of the rate of convergence of the projection-iteration method based on the conditional gradient method (for different ways of specifying a step multiplier) of minimization of approximating functionals in certain spaces isomorphic to subspaces of the original space. We prove theorems on the convergence of a projection-iteration method and obtain estimates of error and convergence degree

2016 ◽  
Vol 4 (2) ◽  
pp. 52 ◽  
Author(s):  
V.K. Shchigolev

A new approach in studying the planetary orbits and deflection of light in General Relativity (GR) by means of the Variational iteration method (VIM) is proposed in this paper. For this purpose, a brief review of the nonlinear geodesic equations in the spherical symmetry spacetime and the main ideas of VIM are given. The appropriate correct functionals are constructed for the geodesics in the spacetime of Schwarzschild, Reissner-Nordström and Kiselev black holes. In these cases, the Lagrange multiplier is obtained from the stationary conditions for the correct functionals. Then, VIM leads to the simple problem of computation of the integrals in order to obtain the approximate solutions of the geodesic equations. On the basis of these approximate solutions, the perihelion shift and the light deflection have been obtained for the metrics mentioned above.


2017 ◽  
Vol 27 (2) ◽  
pp. 616-639 ◽  
Author(s):  
Nicholas Boyd ◽  
Geoffrey Schiebinger ◽  
Benjamin Recht

Author(s):  
Hossein Jafari ◽  
Hale Tajadodi ◽  
Dumitru Baleanu

AbstractIn this paper, we introduce a modified variational iteration method (MVIM) for solving Riccati differential equations. Also the fractional Riccati differential equation is solved by variational iteration method with considering Adomians polynomials for nonlinear terms. The main advantage of the MVIM is that it can enlarge the convergence region of iterative approximate solutions. Hence, the solutions obtained using the MVIM give good approximations for a larger interval. The numerical results show that the method is simple and effective.


2009 ◽  
Vol 64 (7-8) ◽  
pp. 439-444 ◽  
Author(s):  
Said Abbasbandy ◽  
Elyas Shivanian

AbstractIn this paper, the variational iteration method is proposed to solve Fredholm’s nth-order integrodifferential equations. The initial approximation is selected wisely which satisfies the initial conditions. The results reveal that this method is very effective and convenient in comparison with other methods.


2017 ◽  
Vol 176 (1) ◽  
pp. 163-177
Author(s):  
Abderrahman Bouhamidi ◽  
Mohammed Bellalij ◽  
Rentsen Enkhbat ◽  
Khalid Jbilou ◽  
Marcos Raydan

2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Nebiye Korkmaz ◽  
Zekeriya Güney

As an approach to approximate solutions of Fredholm integral equations of the second kind, adaptive hp-refinement is used firstly together with Galerkin method and with Sloan iteration method which is applied to Galerkin method solution. The linear hat functions and modified integrated Legendre polynomials are used as basis functions for the approximations. The most appropriate refinement is determined by an optimization problem given by Demkowicz, 2007. During the calculationsL2-projections of approximate solutions on four different meshes which could occur between coarse mesh and fine mesh are calculated. Depending on the error values, these procedures could be repeated consecutively or different meshes could be used in order to decrease the error values.


Sign in / Sign up

Export Citation Format

Share Document