A distributed algorithm for high-dimension convex quadratically constrained quadratic programs

DOI10.1007/s10589-021-00319-xzbMath1481.90243arXiv1909.00083OpenAlexW3205271812MaRDI QIDQ2057223

Andrew L. Liu, Run Chen

Publication date: 8 December 2021

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.00083

zbMATH Keywords

parallel computingdistributed algorithmproximal methodconvex QCQP

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Uses Software

• CPLEX
• ElemStatLearn
• SCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conic optimization via operator splitting and homogeneous self-dual embedding
• Applications of second-order cone programming
• A proximal-based deomposition method for compositions method for convex minimization problems
• Arcing classifiers. (With discussion)
• Distributed Semidefinite Programming With Application to Large-Scale System Analysis
• Randomized Algorithms for Optimal Solutions of Double-Sided QCQP With Applications in Signal Processing
• Consensus-ADMM for General Quadratically Constrained Quadratic Programming
• Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
• Norms on Direct Sums and Tensor Products

This page was built for publication: A distributed algorithm for high-dimension convex quadratically constrained quadratic programs