Alternating minimal energy methods for linear systems in higher dimensions. Part II: Faster algorithm and application to nonsymmetric systems
Max-Planck-Institut für Mathematik in den Naturwissenschaften(德国马克斯·普朗克自然科学数学研究所);Institute of Numerical Mathematics, Russian Academy of Sciences(俄罗斯科学院计算数学研究所);University of Southampton(南安普顿大学)
In this paper we accomplish the development of the fast rank-adaptive solver for tensor-structured symmetric positive definite linear systems in higher dimensions. In [arXiv:1301.6068] this problem is approached by alternating minimization of the energy function, which we combine with steps of the basis expansion in accordance with the steepest descent algorithm. In this paper we combine the same steps in such a way that the resulted algorithm works with one or two neighboring cores at a time. The recurrent interpretation of the algorithm allows to prove the global convergence and to estimate the convergence rate. We also propose several strategies, both rigorous and heuristic, to compute new subspaces for the basis enrichment in a more efficient way. We test the algorithm on a number of high-dimensional problems, including the non-symmetrical Fokker-Planck and chemical master equations, for which the efficiency of the method is not fully supported by the theory. In all examples we observe a convincing fast convergence and high efficiency of the proposed method.
Accelerated Stochastic ADMM with Variance Reduction
Computer Science Institute, Zhejiang University(浙江大学计算机学院);Department of Respiratory Diseases, The First Affiliated Hospital, College of Medicine Zhejiang University(浙江大学医学院附属第一医院呼吸科)
Linearized Alternating Direction Method with Parallel Splitting and Adaptive Penalty for Separable Convex Programs in Machine Learning
Key Lab. of Machine Perception (MOE), School of EECS, Peking University(机器感知重点实验室(教委)、电子工程学院、北京大学);School of Software and Microelectronics, Peking University(软件与微电子学院、北京大学)