- A Bregman alternating direction method of multipliers for sparse probabilistic Boolean network problem Deng Kangkang (kk19931208163.com) Peng Zheng (pzhengfzu.edu.cn) Abstract: The main task of genetic regulatory networks is to construct a sparse probabilistic Boolean network (PBN) based on a given transition-probability matrix and a set of Boolean networks (BNs). In this paper, a Bregman alternating direction method of multipliers (BADMM) is proposed to solve the minimization problem raised in PBN. All the customized subproblem-solvers of the BADMM do not involve matrix multiplication, consequently the proposed method is in a position to deal with some huge-scale problems. The convergence to stationary point of the BADMM is proved under some mild conditions. Numerical experiments show that the BADMM is effective and efficient comparing with some existing methods. Keywords: Genetic regulatory networks, Sparse probabilistic Boolean network, $L_{\frac{1}{2}}$-regularization, Separable minimization, Bregman alternating direction method of multipliers. Category 1: Applications -- Science and Engineering Category 2: Applications -- Science and Engineering (Biomedical Applications ) Category 3: Nonlinear Optimization (Constrained Nonlinear Optimization ) Citation: Download: [PDF]Entry Submitted: 04/11/2017Entry Accepted: 04/12/2017Entry Last Modified: 04/19/2017Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Optmization Society.