On The Geometric Analysis of A Quartic-quadratic Optimization Problem under A Spherical Constraint

Abstract

This paper considers the problem of solving a special quartic-quadratic optimization problem with a single sphere constraint, namely, finding a global and local minimizer of $\frac{1}{2}{\mathbf{z}}^{\ast }A\mathbf{z}+\frac{\beta }{2}{\sum }_{k=1}^n|z_k{|}^4$ such that $\Vert \mathbf{z}{\Vert }_2=1$. This problem spans multiple domains including quantum mechanics and chemistry sciences and we investigate the geometric properties of this optimization problem. Fourth-order optimality conditions are derived for characterizing local and global minima. When the matrix in the quadratic term is diagonal, the problem has no spurious local minima and global solutions can be represented explicitly and calculated in $O(n\log n)$ operations. When $A$ is a rank one matrix, the global minima of the problem are unique under certain phase shift schemes. The strict-saddle property, which can imply polynomial time convergence of second-order-type algorithms, is established when the coefficient $\beta$ of the quartic term is either at least $O(n^{3/2})$ or not larger than $O(1)$. Finally, the Kurdyka-Lojasiewicz exponent of quartic-quadratic problem is estimated and it is shown that the exponent is $1/4$ for a broad class of stationary points.

References in corpus (18)

• A Simpler Approach to Matrix Completion
• Mathematical theory and numerical methods for Bose-Einstein condensation
• The Complex Gradient Operator and the CR-Calculus
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Guaranteed Matrix Completion via Non-convex Factorization
• Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picture
• No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
• Nonconvex phase synchronization
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method
• Gradient Descent Converges to Minimizers
• Efficient approaches for escaping higher order saddle points in non-convex optimization
• On the low-rank approach for semidefinite programs arising in synchronization and community detection
• Numerical Solution of the Two-Dimensional Gross-Pitaevskii Equation for Trapped Interacting Atoms
• On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
• Understanding the Loss Surface of Neural Networks for Binary Classification
• Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions
• Nonconvex Robust Low-rank Matrix Recovery