Multiplicative updates for symmetric-cone factorizations

08/02/2021
āˆ™
by   Yong Sheng Soh, et al.
āˆ™
0
āˆ™

Given a matrix Xāˆˆā„^mƗ n_+ with non-negative entries, the cone factorization problem over a cone š’¦āŠ†ā„^k concerns computing { a_1,ā€¦, a_m}āŠ†š’¦ and { b_1,ā€¦, b_n}āŠ†Ā š’¦^* belonging to its dual so that X_ij = āŸØ a_i, b_j āŸ© for all iāˆˆ [m], jāˆˆ [n]. Cone factorizations are fundamental to mathematical optimization as they allow us to express convex bodies as feasible regions of linear conic programs. In this paper, we introduce and analyze the symmetric-cone multiplicative update (SCMU) algorithm for computing cone factorizations when š’¦ is symmetric; i.e., it is self-dual and homogeneous. Symmetric cones are of central interest in mathematical optimization as they provide a common language for studying linear optimization over the nonnegative orthant (linear programs), over the second-order cone (second order cone programs), and over the cone of positive semidefinite matrices (semidefinite programs). The SCMU algorithm is multiplicative in the sense that the iterates are updated by applying a meticulously chosen automorphism of the cone computed using a generalization of the geometric mean to symmetric cones. Using an extension of Lieb's concavity theorem and von Neumann's trace inequality to symmetric cones, we show that the squared loss objective is non-decreasing along the trajectories of the SCMU algorithm. Specialized to the nonnegative orthant, the SCMU algorithm corresponds to the seminal algorithm by Lee and Seung for computing Nonnegative Matrix Factorizations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
āˆ™ 06/01/2021

A Non-commutative Extension of Lee-Seung's Algorithm for Positive Semidefinite Factorizations

Given a matrix Xāˆˆā„_+^mƗ n with nonnegative entries, a Positive Semidefin...
research
āˆ™ 07/06/2023

Multiplicative Updates for Online Convex Optimization over Symmetric Cones

We study online convex optimization where the possible actions are trace...
research
āˆ™ 11/01/2022

Linear optimization over homogeneous matrix cones

A convex cone is homogeneous if its automorphism group acts transitively...
research
āˆ™ 10/19/2021

A New Extension of Chubanov's Method to Symmetric Cones

We propose a new variant of Chubanov's method for solving the feasibilit...
research
āˆ™ 02/08/2018

Exact algorithms for semidefinite programs with degenerate feasible set

Let A_0, ..., A_n be m Ɨ m symmetric matrices with entries in Q, and let...
research
āˆ™ 03/08/2022

A Fast Scale-Invariant Algorithm for Non-negative Least Squares with Non-negative Data

Nonnegative (linear) least square problems are a fundamental class of pr...

Please sign up or login with your details

Forgot password? Click here to reset