A new method for computing Moore–Penrose inverse matrices

The Moore–Penrose inverse of an arbitrary matrix (including singular and rectangular) has many applications in statistics, prediction theory, control system analysis, curve fitting and numerical analysis. In this paper, an algorithm based on the conjugate Gram–Schmidt process and the Moore–Penrose inverse of partitioned matrices is proposed for computing the pseudoinverse of an m×n$m\times n$ real matrix A$A$ with m≥n$m\ge n$ and rank r≤n$r\le n$. Numerical experiments show that the resulting pseudoinverse matrix is reasonably accurate and its computation time is significantly less than that of pseudoinverses obtained by the other methods for large sparse matrices.     

Smale’s point estimate theory for Newton’s method on Lie groups

We introduce the notion of the (one-parameter subgroup) γ$\gamma$-condition for a map f$f$ from a Lie group to its Lie algebra and establish α$\alpha$-theory and γ$\gamma$-theory for Newton’s method for a map f$f$ satisfying this condition. Applications to analytic maps are provided, and Smale’s α$\alpha$-theory and γ$\gamma$-theory are extended and developed. Examples arising from initial value problems on Lie group are presented to illustrate applications of our results.     

Some decomposition results for a class of vacation queues

We analyze the MAP/PH/1 vacation system at arbitrary times using the matrix-analytic method, and obtain decomposition results for the R$R$ and G$G$ matrices. The decomposition results reduce the amount of computational effort needed to obtain these matrices. The results for the G$G$ matrix are extended to the BMAP/PH/1 system. We also show that in the case of the Geo/PH/1 and M/PH/1 systems with PH vacations both the G$G$ and R$R$ matrices can be obtained explicitly.     

The approximation characteristic of diagonal matrix in probabilistic setting

In this paper, the approximation characteristic of a diagonal matrix in probabilistic and average case settings is investigated. And the asymptotic degree of the probabilistic linear (n,δ)$(n,\delta )$-width and p$p$-average linear n$n$-width of diagonal matrix M$M$ are determined.     

Stable categories of higher preprojective algebras

We introduce (n+1)$(n+1)$-preprojective algebras of algebras of global dimension n$n$. We show that if an algebra is n$n$-representation-finite then its (n+1)$(n+1)$-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)$(n+1)$-preprojective algebra is (n+1)$(n+1)$-Calabi–Yau, and, more precisely, it is the (n+1)$(n+1)$-Amiot cluster category of the stable n$n$-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)$(n+1)$-cluster tilting object. We show that even if the (n+1)$(n+1)$-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}$n\in \{1,2\}$) the results above still hold for the stable category of Cohen–Macaulay modules.     

Nonlinear maps preserving Jordan *-products

Let η$\eta$ be a non-zero scalar. In this paper, we investigate a bijective map ?$?$ between two von Neumann algebras, one of which has no central abelian projections, satisfying ?(AB+ηBA^∗)=?(A)?(B)+η?(B)?(A)^∗$?(AB+\eta B{A}^{\ast })=?\left(A\right)?\left(B\right)+\eta ?\left(B\right)?{\left(A\right)}^{\ast }$ for all A,B$A,B$ in the domain. It is showed that ?$?$ is a linear *-isomorphism if η$\eta$ is not real and ?$?$ is a sum of a linear *-isomorphism and a conjugate linear *-isomorphism if η$\eta$ is real.     

Constructing uniform designs: A heuristic integer programming method

In this paper, the wrap-around _L2$L_2$-discrepancy (WD) of asymmetrical design is represented as a quadratic form, thus the problem of constructing a uniform design becomes a quadratic integer programming problem. By the theory of optimization, some theoretic properties are obtained. Algorithms for constructing uniform designs are then studied. When the number of runs n$n$ is smaller than the number of all level-combinations m$m$, the construction problem can be transferred to a zero–one quadratic integer programming problem, and an efficient algorithm based on the simulated annealing is proposed. When n≥m$n\ge m$, another algorithm is proposed. Empirical study shows that when n$n$ is large, the proposed algorithms can generate designs with lower WD compared to many existing methods. Moreover, these algorithms are suitable for constructing both symmetrical and asymmetrical designs.     

Quadratic reflected BSDEs with unbounded obstacles

In this paper, we analyze a real-valued reflected backward stochastic differential equation (RBSDE) with an unbounded obstacle and an unbounded terminal condition when its generator f$f$ has quadratic growth in the z$z$-variable. In particular, we obtain existence, uniqueness, and stability results, and consider the optimal stopping for quadratic g$g$-evaluations. As an application of our results we analyze the obstacle problem for semi-linear parabolic PDEs in which the non-linearity appears as the square of the gradient. Finally, we prove a comparison theorem for these obstacle problems when the generator is concave in the z$z$-variable.     

An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces

In this paper, a new monotonicity, M$M$-monotonicity, is introduced, and the resolvent operator of an M$M$-monotone operator is proved to be single valued and Lipschitz continuous. With the help of the resolvent operator, an equivalence between the variational inequality VI(C,F+G)$(C,F+G)$ and the fixed point problem of a nonexpansive mapping is established. A proximal point algorithm is constructed to solve the fixed point problem, which is proved to have a global convergence under the condition that F$F$ in the VI problem is strongly monotone and Lipschitz continuous. Furthermore, a convergent path Newton method, which is based on the assumption that the projection mapping _∏C(⋅)${\prod }_C(\cdot )$ is semismooth, is given for calculating ε$\epsilon$-solutions to the sequence of fixed point problems, enabling the proximal point algorithm to be implementable.     

Periodic solutions for a Rayleigh system of p-Laplacian type

By using the generalized Borsuk theorem in coincidence degree theory, some criteria for guaranteeing the existence of ω$\omega$-periodic solutions for a Rayleigh system of p$p$-Laplacian type are derived.     

Some generalizations of Ekeland-type variational principle with applications to equilibrium problems and fixed point theory

In this paper, we introduce the concept of a Q$Q$-function defined on a quasi-metric space which generalizes the notion of a τ$\tau$-function and a w$w$-distance. We establish Ekeland-type variational principles in the setting of quasi-metric spaces with a Q$Q$-function. We also present an equilibrium version of the Ekeland-type variational principle in the setting of quasi-metric spaces with a Q$Q$-function. We prove some equivalences of our variational principles with Caristi–Kirk type fixed point theorems for multivalued maps, the Takahashi minimization theorem and some other related results. As applications of our results, we derive existence results for solutions of equilibrium problems and fixed point theorems for multivalued maps. We also extend the Nadler’s fixed point theorem for multivalued maps to a Q$Q$-function and in the setting of complete quasi-metric spaces. As a consequence, we prove the Banach contraction theorem for a Q$Q$-function and in the setting of complete quasi-metric spaces. The results of this paper extend and generalize many results appearing recently in the literature.     

A combined scalarizing method for multiobjective programming problems

In this paper, a new general scalarization technique for solving multiobjective optimization problems is presented. After studying the properties of this formulation, two problems as special cases of this general formula are considered. It is shown that some well-known methods such as the weighted sum method, the ?$?$-constraint method, the Benson method, the hybrid method and the elastic ?$?$-constraint method can be subsumed under these two problems. Then, considering approximate solutions, some relationships between ε$\epsilon$-(weakly, properly) efficient points of a general (without any convexity assumption) multiobjective optimization problem and ?$?$-optimal solutions of the introduced scalarized problem are achieved.