A large class of separable quadratic programming problems is presented The problems in the class can be solved in linear time The class in cludes the separable convex quadratic transportation problem with a xed number of sources and separable convex quadratic programming with nonnegativity con straints and a xed number of linear equality constraints

Abstract For regularized optimization that minimizes the sum of a smooth term and regularizer promotes structured solutions, inexact proximal-Newton-type methods, or successive quadratic approximation (SQA) are widely used for their superlinear convergence in terms iterations. However, unlike counter parts optimization, they suffer from lengthy running time solving subproblems because even appr...

In this paper problem of finite-time optimal state feedback control for a class of time-varying linear parameter-varying (LPV) systems with a known delay in the state vector under quadratic cost functional is investigated via a successive approximation algorithm. The method of successive approximation algorithm results an iterative scheme, which successively improves any initial control law ult...