2 problems

Almost-sure global convergence of the subgradient method for \ell_1-norm rank-one symmetric matrix factorization
Consider the $\ell_1$ -norm rank-one symmetric matrix factorization problem and initialize the subgradient method randomly, with an initialization distribution absolutely continuous…
openmatrix-factorization nonsmooth-optimization subgradient-methods
0 responses
04
BFGS for the unit ball
BFGS for the unit ball. The trial step $s$ converges to zero.
openbfgs nonsmooth-optimization quasi-newton-methods
0 responses
06

Almost-sure global convergence of the subgradient method for \ell_1-norm rank-one symmetric matrix factorization