Low-rank optimization on the cone of positive semidefinite matrices

We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.

Low-rank optimization with trace norm penalty

The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed optimization scheme converges superlinearly to the global solution while maintaining complexity that is linear in the number of rows and columns of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach that outperforms the naive warm-restart approach on the fixed-rank quotient manifold. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression. © 2013 Society for Industrial and Applied Mathematics.

The statistics of the second order response of an FPSO in spreading seas

An expression for the probability density function of the second order response of a general FPSO in spreading seas is derived by using the Kac-Siegert approach. Various approximations of the second order force transfer functions are investigated for a ship-shaped FPSO. It is found that, when expressed in non-dimensional form, the probability density function of the response is not particularly sensitive to wave spreading, although the mean squared response and the resulting dimensional extreme values can be sensitive. The analysis is then applied to a Sevan FPSO, which is a large cylindrical buoy-like structure. The second order force transfer functions are derived by using an efficient semi-analytical hydrodynamic approach, and these are then employed to yield the extreme response. However, a significant effect of wave spreading on the statistics for a Sevan FPSO is found even in non-dimensional form. It implies that the exact statistics of a general ship-shaped FPSO may be sensitive to the wave direction, which needs to be verified in future work. It is also pointed out that the Newman's approximation regarding the frequency dependency of force transfer function is acceptable even for the spreading seas. An improvement on the results may be attained when considering the angular dependency exactly. Copyright © 2009 by ASME.