Related papers: An efficient family of optimal eight-order iterati…
In this paper, several row and column orthogonal projection methods are proposed for solving matrix equation $AXB=C$, where the matrix $A$ and $B$ are full rank or rank deficient and equation is consistent or not. These methods are…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
The application of the Kudryashov method for finding exact solutions of the high order nonlinear evolution equations is considered. Some classes of solitary wave solutions for the families of nonlinear evolution equations of fifth, sixth…
A nonlinear algebraic equation system of 5 variables is numerically solved, which is derived from the application of the Fourier transform to a differential equation system that allows modeling the behavior of the temperatures and the…
We develop the Akhiezer iteration, a generalization of the classical Chebyshev iteration, for the inner product-free, iterative solution of indefinite linear systems using orthogonal polynomials for measures supported on multiple, disjoint…
In this paper, we introduce an iterative process which converges strongly to a common element of sets of solutions of finite family of generalized equilibrium problems, sets of fixed points of finite family of continuous relatively…
In this set of papers we formulate a stand alone method to derive maximal number of linearizing transformations for nonlinear ordinary differential equations (ODEs) of any order including coupled ones from a knowledge of fewer number of…
This paper deals with the estimation of the modes of an univariate mixture when the number of components is known and when the component density are well separated. We propose an algorithm based on the minimization of the "kp" criterion we…
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly…
Among the family of fourth-order time integration schemes, the two-stage Gauss--Legendre method, which is an implicit Runge--Kutta method based on collocation, is the only superconvergent. The computational cost of this implicit scheme for…
Inverse problems are in many cases solved with optimization techniques. When the underlying model is linear, first-order gradient methods are usually sufficient. With nonlinear models, due to nonconvexity, one must often resort to…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
This paper presents a new class of 8th order canonical polynomials in n-dimensional real space. Based on the sequential canonical dual transformation, all extrema are obtained. The method can be used to solve the associated 7th order…
In this article, we derive an iterative scheme through a quasi-Newton technique to capture robust weakly efficient points of uncertain multiobjective optimization problems under the upper set less relation. It is assumed that the set of…
We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…
Taylor series methods show a newfound promise for the solution of non-stiff ordinary differential equations (ODEs) given the rise of new compiler-enhanced techniques for calculating high order derivatives. In this paper we detail a new…
The motivation of this work is to illustrate the efficiency of some often overlooked alternatives to deal with optimization problems in systems and control. In particular, we will consider a problem for which an iterative linear matrix…
In this article we develop and analyze novel iterative regularization techniques for the solution of systems of nonlinear ill--posed operator equations. The basic idea consists in considering separately each equation of this system and…
We demonstrate an iterative scheme to approximate the optimal transportation problem with a discrete target measure under certain standard conditions on the cost function. Additionally, we give a finite upper bound on the number of…
The simple assembly line balancing problem (SALBP) concerns the assignment of tasks with pre-defined processing times to work stations that are arranged in a line. Hereby, precedence constraints between the tasks must be respected. The…