Riesz transforms for symmetric diffusion operators on complete Riemannian manifolds.
The Cauchy problem for the two dimensional Euler–Poisson system
The Euler-Poisson system is a fundamental two-fluid model to describe the dynamics of the plasma consisting of compressible electrons and a uniform ion background. In the 3D case Guo [7] first constructed a global smooth irrotational solution by using the dispersive Klein-Gordon effect. It has been conjectured that same results should hold in the two-dimensional case. In our recent work [13], we proved the existence of a family of smooth solutions by constructing the wave operators for the 2D system....
Smoothness of Itô maps and diffusion processes on path spaces (I)
Littlewood-Paley-Stein functions on complete Riemannian manifolds for 1 ≤ p ≤ 2
We study the weak type (1,1) and the -boundedness, 1 < p ≤ 2, of the so-called vertical (i.e. involving space derivatives) Littlewood-Paley-Stein functions and ℋ respectively associated with the Poisson semigroup and the heat semigroup on a complete Riemannian manifold M. Without any assumption on M, we observe that and ℋ are bounded in , 1 < p ≤ 2. We also consider modified Littlewood-Paley-Stein functions that take into account the positivity of the bottom of the spectrum. Assuming that...
Two generalizations of Cheeger-Gromoll splitting theorem via Bakry-Emery Ricci curvature
In this paper, we prove two generalized versions of the Cheeger-Gromoll splitting theorem via the non-negativity of the Bakry-Émery Ricci curavture on complete Riemannian manifolds.
On the rigidity of minimal mass solutions to the focusing mass-critical NLS for rough initial data.
Solvability for second-order m-point boundary value problems at resonance on the half-line.
Strong convergence theorems by shrinking projection methods for class mappings.
Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming
The smoothing-type algorithm is a powerful tool for solving the second-order cone programming (SOCP), which is in general designed based on a monotone line search. In this paper, we propose a smoothing-type algorithm for solving the SOCP with a non-monotone line search. By using the theory of Euclidean Jordan algebras, we prove that the proposed algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results are also reported which indicate...
A smoothing Newton method for the second-order cone complementarity problem
In this paper we introduce a new smoothing function and show that it is coercive under suitable assumptions. Based on this new function, we propose a smoothing Newton method for solving the second-order cone complementarity problem (SOCCP). The proposed algorithm solves only one linear system of equations and performs only one line search at each iteration. It is shown that any accumulation point of the iteration sequence generated by the proposed algorithm is a solution to the SOCCP. Furthermore,...
A new one-step smoothing newton method for second-order cone programming
In this paper, we present a new one-step smoothing Newton method for solving the second-order cone programming (SOCP). Based on a new smoothing function of the well-known Fischer-Burmeister function, the SOCP is approximated by a family of parameterized smooth equations. Our algorithm solves only one system of linear equations and performs only one Armijo-type line search at each iteration. It can start from an arbitrary initial point and does not require the iterative points to be in the sets...
Page 1