Accelerating gradient projection methods for -constrained signal recovery by steplength selection rules

We propose a new gradient projection algorithm that compares favorably with the fastest algorithms available to date for ℓ₁-constrained sparse recovery from noisy data, both in the compressed sensing and inverse problem frameworks. The method exploits a line-search along the feasible direction and an adaptive steplength selection based on recent strategies for the alternation of the well-known Barzilai–Borwein rules. The convergence of the proposed approach is discussed and a computational study on both well conditioned and ill-conditioned problems is carried out for performance evaluations in comparison with five other algorithms proposed in the literature.     

A completeness result for the simply typed -calculus

In this paper, we define a realizability semantics for the simply typed λμ-calculus. We show that, if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.     

Dynamical analysis of the transmission of seasonal diseases using the differential transformation method

The aim of this paper is to apply the differential transformation method (DTM) to solve systems of nonautonomous nonlinear differential equations that describe several epidemic models where the solutions exhibit periodic behavior due to the seasonal transmission rate. These models describe the dynamics of the different classes of the populations. Here the concept of DTM is introduced and then it is employed to derive a set of difference equations for this kind of epidemic models. The DTM is used here as an algorithm for approximating the solutions of the epidemic models in a sequence of time intervals. In order to show the efficiency of the method, the obtained numerical results are compared with the fourth-order Runge–Kutta method solutions. Numerical comparisons show that the DTM is accurate, easy to apply and the calculated solutions preserve the properties of the continuous models, such as the periodic behavior. Furthermore, it is showed that the DTM avoids large computational work and symbolic computation.     

A new iterative method for equilibrium problems and fixed point problems of infinitely nonexpansive mappings and monotone mappings

In this paper, we introduce a new iterative scheme for finding the common element of the set of common fixed points of infinitely many nonexpansive mappings, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for α-inverse-strongly monotone mapping in Hilbert spaces. We prove that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions. This main result improve and extend Plubtieng and Punpaeng’s corresponding result [S. Plubtieng, R. Punpaeng, A new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings, Applied Mathematics and Computation 197 (2008), 548–558]. Using this theorem, we obtain three corollaries.     

On Rockafellar’s theorem using proximal point algorithm involving -maximal monotonicity framework

On the basis of the general framework of H-maximal monotonicity (also referred to as H-monotonicity in the literature), a generalization to Rockafellar’s theorem in the context of solving a general inclusion problem involving a set-valued maximal monotone operator using the proximal point algorithm in a Hilbert space setting is explored. As a matter of fact, this class of inclusion problems reduces to a class of variational inequalities as well as to a class of complementarity problems. This proximal point algorithm turns out to be of interest in the sense that it plays a significant role in certain computational methods of multipliers in nonlinear programming. The notion of H-maximal monotonicity generalizes the general theory of set-valued maximal monotone mappings to a new level. Furthermore, some results on general firm nonexpansiveness and resolvent mapping corresponding to H-monotonicity are also given.     

On the forms of the truncated LU decomposition

Matrix LU decomposition has six ijk forms. Different forms have different computational complexities and storage requirements, particularly on vector and parallel computers. Other factors governing the choice of a particular form are considered. For treating Fredholm integral equations of the first kind, the truncated LU decomposition of the resulting system matrix is recommended. Required modifications to selected known ijk forms are presented.     

On the complexity of some subgraph problems

We study the complexity of the problem of deciding the existence of a spanning subgraph of a given graph, and of that of finding a maximum (weight) such subgraph. We establish some general relations between these problems, and we use these relations to obtain new NP-completeness results for maximum (weight) spanning subgraph problems from analogous results for existence problems and from results in extremal graph theory. On the positive side, we provide a decomposition method for the maximum (weight) spanning chordal subgraph problem that can be used, e.g., to obtain a linear (or O(nlogn)) time algorithm for such problems in graphs with vertex degree bounded by 3.     

The behavior of best -approximations as . A counterexample of convergence

In the space of summable sequences we give an example of a one-dimensional affine subspace C such that the best L_p-approximations of 0 from C fail to converge as p↓1. We thus give an answer to this problem of convergence in infinite measure spaces.     

On Banach spaces whose norm-open sets are -sets in the weak topology

We investigate non-separable Banach spaces whose norm-open sets are countable unions of sets closed in the weak topology and a narrower class of Banach spaces with a network for the norm topology which is σ-discrete in the weak topology. In particular, we answer a question of Arhangel'skii exhibiting various examples of non-separable function spaces C(K) with a σ-discrete network for the pointwise topology and (consistently) we answer some questions of Edgar and Oncina concerning Borel structures and Kadec renormings in Banach spaces.     

Travelling wave solutions for the nonlinear dispersion Drinfel’d–Sokolov () system

In this paper, travelling wave solutions for the nonlinear dispersion Drinfel’d–Sokolov system (called D(m,n) system) are studied by using the Weierstrass elliptic function method. As a result, more new exact travelling wave solutions to the D(m,n) system are obtained including not only all the known solutions found by Xie and Yan but also other more general solutions for different parameters m,n. Moreover, it is also shown that the D(m,1) system with linear dispersion possess compacton and solitary pattern solutions. Besides that, it should be pointed out that the approach is direct and easily carried out without the aid of mathematical software if compared with other traditional methods. We believe that the method can be widely applied to other similar types of nonlinear partial differential equations (PDEs) or systems in mathematical physics.     

Convergence for a class of delayed recurrent neural networks without M-matrix condition

In this paper, we investigate the asymptotic behavior of solutions to a class of recurrent neural network model with delays. Without assuming M-matrix condition, it is shown that every solution of the network tends to an equilibrium point as t→∞. Our results improve and extend some corresponding ones already known.     

Algorithm for solving a new class of general mixed variational inequalities in Banach spaces

In this paper, a new concept of η-proximal mapping for a proper subdifferentiable functional (which may not be convex) on a Banach space is introduced. An existence and Lipschitz continuity of the η-proximal mapping are proved. By using properties of the η-proximal mapping, a new class of general mixed variational inequalities is introduced and studied in Banach spaces. An existence theorem of solutions is established and a new iterative algorithm for solving the general mixed variational inequality is suggested. A convergence criteria of the iterative sequence generated by the new algorithm is also given.     

The generalized relaxed proximal point algorithm involving -maximal-relaxed accretive mappings with applications to Banach spaces

A general design for the relaxed proximal point algorithm using the notion of A-maximal-relaxed accretiveness is developed, and then the convergence analysis for this algorithm in the context of solving a general class of nonlinear inclusion problems is examined along with some other results of interest involving A-maximal-relaxed accretive mappings in a real Banach space setting.     

Interlacing and spacing properties of zeros of polynomials, in particular of orthogonal and -minimal polynomials,

Let be a sequence of polynomials with real coefficients such that uniformly for [α-δ,β+δ] with G(eⁱ)≠0 on [α,β], where 0α<βπ and δ>0. First it is shown that the zeros of are dense in [α,β], have spacing of precise order π/n and are interlacing with the zeros of p_n+1(cos) on [α,β] for every nn₀. Let be another sequence of real polynomials with uniformly on [α-δ,β+δ] and on [α,β]. It is demonstrated that for all sufficiently large n the zeros of p_n(cos) and strictly interlace on [α,β] if on [α,β]. If the last expression is zero then a weaker kind of interlacing holds. These interlacing properties of the zeros are new for orthogonal polynomials also. For instance, for large n a simple criteria for interlacing of zeros of Jacobi polynomials on [-1+,1-], >0, is obtained. Finally it is shown that the results hold for wide classes of weighted L_q-minimal polynomials, q[1,∞], linear combinations and products of orthogonal polynomials, etc.     

Coincidence and common fixed points for hybrid strict contractions without the weakly commuting condition

In this work, we establish new coincidence and common fixed point theorems for hybrid strict contraction maps by dropping the assumption “f is T-weakly commuting” for a hybrid pair (f,T) of multivalued maps in Theorem 3.10 of T. Kamran (2004) [8]. As an application, an invariant approximation result is derived.     

Application of continuous-time programming problems to a class of variational-type inequalities

In this paper, we establish sufficiency criteria under generalized ρ−(η,θ)-invexity conditions for general continuous-time programming problems with nonlinear equality/inequality constraints. Using this we establish some existence criteria for solutions of a class of variational-type inequalities.     

King type modification of Meyer-König and Zeller operators based on the -integers

In the present paper, introducing a King type modification of the Meyer-König and Zeller (MKZ) operators, we prove that the error estimation of these operators is better than the classical MKZ operators. Furthermore, a King type modification of the q-MKZ is also introduced and the rate of convergence of this modification is examined.     

Maximum fractional factors in graphs

We prove that fractional k-factors can be transformed among themselves by using a new adjusting operation repeatedly. We introduce, analogous to Berge’s augmenting path method in matching theory, the technique of increasing walk and derive a characterization of maximum fractional k-factors in graphs. As applications of this characterization, several results about connected fractional 1-factors are obtained.