Abstract: This paper presents a new algorithm for optimal power flow (OPF), which is based on P/Q decomposition of OPF problem and on combined application of quadratic and separable programming ...

1 Lingnan College, Sun Yat-sen University, Guangzhou, China. 2 School of Economic and Business Administration, Chongqing University, Chongqing, China. The nonlinear multidimensional knapsack problem ...

In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide ...

ABSTRACT: The goal of this paper study is to schedule the power generation units to minimize fuel consumption cost based on a model that solves unit commitment problems. This can be done by utilizing ...

An illustration of a magnifying glass. An illustration of a magnifying glass.

Citation: Gillis, N. , & Vavasis, S. A. . (2015). Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization. SIAM J. Optim., 25, 677-698. Download ...