A stability criterion for high-frequency oscillations

We show that a simple Levi compatibility condition determines stability of WKB solutions to semilinear hyperbolic initial-value problems issued from highly-oscillating initial data with large amplitudes. The compatibility condition involves the hyperbolic operator, the fundamental phase associated with the initial oscillation, and the semilinear source term; it states roughly that hyperbolicity is preserved around resonances. If the compatibility condition is satisfied, the solutions are defined over time intervals independent of the wavelength, and the associated WKB solutions are stable under a large class of initial perturbations. If the compatibility condition is not satisfied, resonances are exponentially amplified, and arbitrarily small initial perturbations can destabilize the WKB solutions in small time. The amplification mechanism is based on the observation that in frequency space, resonances correspond to points of weak hyperbolicity. At such points, the behavior of the system depends on the lower order terms through the compatibility condition. The analysis relies, in the unstable case, on a short-time Duhamel representation formula for solutions of zeroth-order pseudo-differential equations. Our examples include coupled Klein-Gordon systems, and systems describing Raman and Brillouin instabilities.Comment: Final version, to appear in M\'em. Soc. Math. F

Schatten-pp Quasi-Norm Regularized Matrix Optimization via Iterative Reweighted Singular Value Minimization

In this paper we study general Schatten-$p$ quasi-norm (SPQN) regularized matrix minimization problems. In particular, we first introduce a class of first-order stationary points for them, and show that the first-order stationary points introduced in [11] for an SPQN regularized $vector$ minimization problem are equivalent to those of an SPQN regularized $matrix$ minimization reformulation. We also show that any local minimizer of the SPQN regularized matrix minimization problems must be a first-order stationary point. Moreover, we derive lower bounds for nonzero singular values of the first-order stationary points and hence also of the local minimizers of the SPQN regularized matrix minimization problems. The iterative reweighted singular value minimization (IRSVM) methods are then proposed to solve these problems, whose subproblems are shown to have a closed-form solution. In contrast to the analogous methods for the SPQN regularized $vector$ minimization problems, the convergence analysis of these methods is significantly more challenging. We develop a novel approach to establishing the convergence of these methods, which makes use of the expression of a specific solution of their subproblems and avoids the intricate issue of finding the explicit expression for the Clarke subdifferential of the objective of their subproblems. In particular, we show that any accumulation point of the sequence generated by the IRSVM methods is a first-order stationary point of the problems. Our computational results demonstrate that the IRSVM methods generally outperform some recently developed state-of-the-art methods in terms of solution quality and/or speed.Comment: This paper has been withdrawn by the author due to major revision and correction