Improved estimates on majorizing sequences for the Newton–Kantorovich method

We approximate a locally unique solution of an equation in Banach space using the Newton–Kantorovich method. Motivated by our earlier works (see references [2–7] in the references list), optimization consideration, and the elegant studies by Cianciaruso with DePascale in (Numer. Funct. Anal. Optim. 27(5–6):529–538, 2006), and Cianciaruso in (Nonlinear Funct. Anal. Appl., 2009, to appear), we provide (by using more precise error estimates on the distances involved): finer error bounds; an at least as precise information on the location of the solution, and a larger convergence domain than in (Numer. Funct. Anal. Optim. 27(5–6):529–538, 2006). Finally, we provide numerical examples where our results can apply to solve equations, but earlier ones can not (see references [8–19]).     

On Existence of Common Fixed Points Under Lipschitz-Type Mapping Pairs with Applications

In this paper, we propose some su?cient conditions to obtain the existence of common fixed points for a pair of self-mappings satisfying Lipschitz-type conditions in noncomplete metric space. Our results improve and extend the results of Pant [Common fixed points of Lipschitz-type mapping pairs, J. Math. Anal. Appl. 240, (1999), 280–283] and Khan et al. [Coincidences of Lipschitz-type hybrid maps and invariant approximation, Numer. Funct. Anal. Optim. 28(9–10), (2007), 1165–1177]. As an application of our results we solve an eigenvalue problem for operators defined on a normed space.     

Strong convergence of an implicit iteration process for a finite family of nonexpansive mappings

The purpose of this paper is to prove the strong convergence of an implicit iteration process to a common fixed point for a finite family of nonexpansive mappings. Our theorems give an affirmative response to a question raised by [Xu and Ori, Numer. Funct. Anal. Optim. 22 (2001) 767–773].     

A Note on First-Order Sufficient Optimality Conditions for Pareto Problems

We take into consideration the first-order sufficient conditions, established by Jiménez and Novo (Numer. Funct. Anal. Optim. 2002; 23:303–322) for strict local Pareto minima. We give here a more operative condition for a strict local Pareto minimum of order 1.     

On the convergence of Newton-type methods under mild differentiability conditions

We introduce the new idea of recurrent functions to provide a new semilocal convergence analysis for Newton-type methods, under mild differentiability conditions. It turns out that our sufficient convergence conditions are weaker, and the error bounds are tighter than in earlier studies in some interesting cases (Chen, Ann Inst Stat Math 42:387–401, 1990; Chen, Numer Funct Anal Optim 10:37–48, 1989; Cianciaruso, Numer Funct Anal Optim 24:713–723, 2003; Cianciaruso, Nonlinear Funct Anal Appl 2009; Dennis 1971; Deuflhard 2004; Deuflhard, SIAM J Numer Anal 16:1–10, 1979; Gutiérrez, J Comput Appl Math 79:131–145, 1997; Hernández, J Optim Theory Appl 109:631–648, 2001; Hernández, J Comput Appl Math 115:245–254, 2000; Huang, J Comput Appl Math 47:211–217, 1993; Kantorovich 1982; Miel, Numer Math 33:391–396, 1979; Miel, Math Comput 34:185–202, 1980; Moret, Computing 33:65–73, 1984; Potra, Libertas Mathematica 5:71–84, 1985; Rheinboldt, SIAM J Numer Anal 5:42–63, 1968; Yamamoto, Numer Math 51: 545–557, 1987; Zabrejko, Numer Funct Anal Optim 9:671–684, 1987; Zinc̆ko 1963). Applications and numerical examples, involving a nonlinear integral equation of Chandrasekhar-type, and a differential equation are also provided in this study.     

Remark on a Paper of Sababheh and Khalil

We show that any Banach space X that has a sequence of unit vectors weakly converging to 0 has a closed and bounded convex set that is not remotal. This extends the main result of Sababheh and Khalil, (Numer. Funct. Anal. Optim. 2008; 29:1166–1170).     

Error estimates for abstract linear–quadratic optimal control problems using proper orthogonal decomposition

In this paper we investigate POD discretizations of abstract linear–quadratic optimal control problems with control constraints. We apply the discrete technique developed by Hinze (Comput. Optim. Appl. 30:45–61, 2005) and prove error estimates for the corresponding discrete controls, where we combine error estimates for the state and the adjoint system from Kunisch and Volkwein (Numer. Math. 90:117–148, 2001; SIAM J. Numer. Anal. 40:492–515, 2002). Finally, we present numerical examples that illustrate the theoretical results.     

A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations

In this paper, we propose a family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations. They come from two modified conjugate gradient methods [W.Y. Cheng, A two term PRP based descent Method, Numer. Funct. Anal. Optim. 28 (2007) 1217–1230; L. Zhang, W.J. Zhou, D.H. Li, A descent modified Polak–Ribiére–Polyak conjugate gradient method and its global convergence, IMA J. Numer. Anal. 26 (2006) 629–640] recently proposed for unconstrained optimization problems. Under appropriate conditions, the global convergence of the proposed method is established. Preliminary numerical results show that the proposed method is promising.     

On the Error Estimates for the Finite Element Approximation of a Class of Boundary Optimal Control Systems

In this article, we consider an application of the abstract error estimate for a class of optimal control systems described by a linear partial differential equation (as stated in Numer. Funct. Anal. Optim. 2009; 30:523–547). The control is applied at the boundary and we consider both, Neumann and Dirichlet optimal control problems. Finite element methods are proposed to approximate the optimal control considering an approximation of the variational inequality resulting from the optimality conditions; this approach is known as classical one. We obtain optimal order error estimates for the control variable and numerical examples, taken from the literature, are included to illustrate the results.     

On remotality for convex sets in Banach spaces

We show that every infinite dimensional Banach space has a closed and bounded convex set that is not remotal. This settles a problem raised by Sababheh and Khalil in [M. Sababheh, R. Khalil, Remotality of closed bounded convex sets, Numer. Funct. Anal. Optim. 29 (2008) 1166–1170].     

Nondifferentiable multiobjective programming under generalized d-univexity

In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex and strong quasi invex functions in Aghezzaf and Hachimi [Numer. Funct. Anal. Optim. 22 (2001) 775], d-invex functions in Antczak [Europ. J. Oper. Res. 137 (2002) 28] and univex functions in Bector et al. [Univex functions and univex nonlinear programming, Proc. Admin. Sci. Assoc. Canada, 1992, p. 115]. By utilizing the new concepts, we derive a Karush–Kuhn–Tucker sufficient optimality condition and establish Mond–Weir type and general Mond–Weir type duality results for the nondifferentiable multiobjective programming problem.     

Second-Order Duality in Multiobjective Programming Involving (F, α, ρ, d)-V-Type I Functions

In this paper, a new class of second-order (F, α, ρ, d)-V-type I functions is introduced that generalizes the notion of (F, α, ρ, θ)-V-convex functions introduced by Zalmai (Computers Math. Appl. 2002; 43:1489–1520) and (F, α, ρ, p, d)-type I functions defined by Hachimi and Aghezzaf (Numer. Funct. Anal. Optim. 2004; 25:725–736). Based on these functions, weak, strong, and strict converse duality theorems are derived for Wolfe and Mond–Weir type multiobjective dual programs in order to relate the efficient and weak efficient solutions of primal and dual problems.     

Convergence theorems of common fixed points for a finite family of Lipschitz pseudocontractions in Banach spaces

In this paper, we continue to study weak convergence problems for the implicit iteration process for a finite family of Lipschitzian continuous pseudocontractions in general Banach spaces. The results presented in this paper improve and extend the corresponding ones of Xu and Ori [H.K. Xu, R.G. Ori, An implicit iteration process for nonexpansive mappings, Numer. Funct. Anal. Optim. 22 (2001) 767–773], Osilike [M.O. Osilike, Implicit iteration process for common fixed points of a finite family of strictly pseudocontractive maps, J. Math. Anal. Appl. 294 (2004) 73–81], Chen et al. [R. Chen, Y.S. Song, H.Y. Zhou, Convergence theorems for implicit iteration process for a finite family of continuous pseudocontractive mappings, J. Math. Anal. Appl. 314 (2006) 701–709] and others.     

An implicit iteration process for solving a fixed point problem of a finite family of multi-valued mappings in Banach spaces

This work is concerned with the strong convergence of an approximating common fixed point sequence of a finite family of multi-valued mappings in a uniformly convex and smooth Banach space using an implicit iteration scheme introduced by Xu and Ori [H.K. Xu, R.G. Ori, An implicit iteration process for nonexpansive mappings, Numer. Funct. Anal. Optim. 22 (2001) 767–773].     

Convergence theorems for implicit iteration process for a finite family of continuous pseudocontractive mappings

In this paper, a necessary and sufficient conditions for the strong convergence to a common fixed point of a finite family of continuous pseudocontractive mappings are proved in an arbitrary real Banach space using an implicit iteration scheme recently introduced by Xu and Ori [H.K. Xu, R.G. Ori, An implicit iteration process for nonexpansive mappings, Numer. Fuct. Anal. Optim. 22 (2001) 767-773] in condition αn∈(0,1], and also strong and weak convergence theorem of a finite family of strictly pseudocontractive mappings of Browder-Petryshyn type is obtained. The results presented extend and improve the corresponding results of M.O. Osilike [M.O. Osilike, Implicit iteration process for common fixed points of a finite family of strictly pseudocontractive maps, J. Math. Anal. Appl. 294 (2004) 73-81].     

Implicit iteration process for common fixed points of a finite family of strictly pseudocontractive maps

Convergence theorems for approximation of common fixed points of strictly pseudocontractive mappings of Browder-Petryshyn type are proved in Banach spaces using an implicit iteration scheme recently introduced by Xu and Ori [Numer. Funct. Anal. Optim. 22 (2001) 767-773].     

Discontinuous Galerkin method for nonlinear convection-diffusion problems with mixed Dirichlet-Neumann boundary conditions

The paper is devoted to the analysis of the discontinuous Galerkin finite element method (DGFEM) applied to the space semidiscretization of a nonlinear nonstationary convection-diffusion problem with mixed Dirichlet-Neumann boundary conditions. General nonconforming meshes are used and the NIPG, IIPG and SIPG versions of the discretization of diffusion terms are considered. The main attention is paid to the impact of the Neumann boundary condition prescribed on a part of the boundary on the truncation error in the approximation of the nonlinear convective terms. The estimate of this error allows to analyse the error estimate of the method. The results obtained represent the completion and extension of the analysis from V. Dolej?í, M. Feistauer, Numer. Funct. Anal. Optim. 26 (2005), 349–383, where the truncation error in the approximation of the nonlinear convection terms was proved only in the case when the Dirichlet boundary condition on the whole boundary of the computational domain was considered.     

Minimal Shape-Preserving Projections Onto Π n : Generalizations and Extensions

The goal of this paper is to further the investigation begun in Chalmers and Prophet, Numer. Funct. Anal. Optimiz. 1997; 18:507–520. With the benefit of nearly 10 years of work, we begin by indicating how several proofs from Chalmers and Prophet, Numer. Funct. Anal. Optimiz. 1997; 18:507–520, can be substantially improved. We show that the problem of preserving k-convexity onto Π _n is one part of a larger shape-preserving problem (multiconvex preservation) relative to Π _n , and we completely solve this expanded problem. And finally, we demonstrate that multiconvex preserving projections constructed in this paper are in fact of minimal operator norm in a large class of Banach spaces.     

Solution of nonlinear convection-diffusion problems by a conservative Galerkin-characteristics method

We consider a scheme for nonlinear (degenerate) convection dominant diffusion problems that arise in contaminant transport in porous media with equilibrium adsorption isotherm. This scheme is based on a regularization relaxation scheme that has been introduced by Jäger and Ka?ur (Numer Math 60:407–427, 1991; M²AN Math Model Numer Anal 29(N5):605–627, 1995) with a type of numerical integration by Bermejo (SIAM J Numer Anal 32:425–455, 1995) to the modified method of characteristics with adjusted advection MMOCAA that was recently developed by Douglas et al. (Numer Math 83(3):353–369, 1999; Comput Geosci 1:155–190, 1997). We present another variant of adjusting advection method. The convergence of the scheme is proved. An error estimate of the approximated scheme is derived. Computational experiments are carried out to illustrate the capability of the scheme to conserve the mass.     

A Crank‐Nicolson and ADI Galerkin method with quadrature for hyperbolic problems

We propose, analyze, and implement fully discrete two‐time level Crank‐Nicolson methods with quadrature for solving second‐order hyperbolic initial boundary value problems. Our algorithms include a practical version of the ADI scheme of Fernandes and Fairweather [SIAM J Numer Anal 28 (1991), 1265–1281] and also generalize the methods and analyzes of Baker [SIAM J Numer Anal 13 (1976), 564–576] and Baker and Dougalis [SIAM J Numer Anal 13 (1976), 577–598]. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005