Search

In this paper we give a quantitative analysis of an explicit iteration method due to C.E. Chidume for the approximation of a zero of an m-accretive operator A : X → 2 X in Banach spaces which does not involve the computation of the resolvent of A. [ABSTRACT FROM AUTHOR]

In this paper we establish some approximation versions of the classical Dinkelbach algorithm for nonlinear fractional optimization problems in Banach spaces. We start by examining what occurs if at any step of the algorithm, the generated point desired to be a minimizer can only be determined with a given error. Next we assume that the step error tends to zero as the algorithm advances. The last version of the algorithm we present is making use of Ekeland's variational principle for generating the sequence of minimizer-like points. In the final part of the article we deliver some results in order to achieve a Palais-Smale type compactness condition that guarantees the convergence of our Dinkelbach-Ekeland algorithm. [ABSTRACT FROM AUTHOR]

In this work, we propose integral global optimality conditions for multiobjective problems not necessarily differentiable. The integral characterization, already known for single objective problems, are extended to multiobjective problems by weighted sum and Chebyshev weighted scalarizations. Using this last scalarization, we propose an algorithm for obtaining an approximation of the weak Pareto front whose effectiveness is illustrated by solving a collection of multiobjective test problems. [ABSTRACT FROM AUTHOR]

This article mainly studies the nonuniform and semi-average sampling of time-varying shift-invariant signals living in a mixed Lebesgue space L p , q (R d + 1) , under the condition that the generator φ of the shift-invariant subspace belongs to a hybrid-norm space of mixed form depending on the orders p and q. First, the sampling stability for two kinds of semi-average sampling functionals is established. Then, we give the corresponding iterative approximation projection algorithms with exponential convergence for recovering the time-based shift-invariant signals from the semi-average samples. [ABSTRACT FROM AUTHOR]

In this article, we give a generalization of the Kantorovich-Szász type operators defined by means of the Brenke type polynomials introduced in the literature and obtain convergence properties of these operators by using Korovkin's theorem. Some graphical examples using the Maple program for this approximation are given. We also establish the order of convergence by using modulus of smoothness and Peetre's K-functional and give a Voronoskaja type theorem. In addition, we deal with the convergence of these operators in a weighted space. [ABSTRACT FROM AUTHOR]

We consider a class of parametric variational inequalities where both the operator and the convex set depend on time. This kind of variational inequalities are useful to model many time dependent equilibrium problems. We study the Lipschitz continuity of the solutions with respect to the time parameter and construct approximations for them which minimize the average worst case error. Some improved estimates of the Lipschitz constant for this class of problems are given. In order to illustrate our procedure, we study a classical network equilibrium problem. [ABSTRACT FROM AUTHOR]

In this article, we use the method of finite-dimensional approximations to derive second-order necessary optimality conditions for singular Pontryagin local minimizers for an unconstrained nonlinear Mayer problem. [ABSTRACT FROM AUTHOR]