A Decomposition Method for Large-scale Convex Quadratically Constrained Quadratic Programs

08/30/2019
by   Run Chen, et al.
0

We consider solving a convex quadratically constrained quadratic program (QCQP), which has a wide range of applications, including machine learning, data analysis and signal processing. While small to mid-sized convex QCQPs can be solved efficiently by interior-point algorithms, large-scale problems pose significant challenges to traditional centralized algorithms, since the exploding volume of data may overwhelm a single computing unit. In this paper, we propose a decomposition method for general non-separable, large-scale convex QCQPs, using the idea of predictor-corrector proximal primal-dual update with an adaptive step size. The algorithm enables distributed storage of data as well as distributed computing. We both establish convergence of the algorithm to a global optimum and test the algorithm on a computer cluster with multiple threads. The numerical test is done on data sets of different scales using Message Passing Interface, and the results show that our algorithm exhibits favourable scalability for large-scale data even when CPLEX fails to provide a solution due to memory limits.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2018

Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization

Recent years have witnessed a surge of interest in parallel and distribu...
research
10/02/2017

Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences

We consider the problem of solving a large-scale Quadratically Constrain...
research
11/23/2015

Stochastic Parallel Block Coordinate Descent for Large-scale Saddle Point Problems

We consider convex-concave saddle point problems with a separable struct...
research
11/21/2017

First-order methods for constrained convex programming based on linearized augmented Lagrangian function

First-order methods have been popularly used for solving large-scale pro...
research
12/20/2019

A New Preconditioning Approach for an Interior Point-Proximal Method of Multipliers for Linear and Convex Quadratic Programming

In this paper, we address the efficient numerical solution of linear and...
research
07/25/2022

On the convergence and sampling of randomized primal-dual algorithms and their application to parallel MRI reconstruction

The Stochastic Primal-Dual Hybrid Gradient or SPDHG is an algorithm prop...
research
05/23/2020

Multivariate Convex Regression at Scale

We present new large-scale algorithms for fitting a multivariate convex ...

Please sign up or login with your details

Forgot password? Click here to reset