Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
From MaRDI portal
Publication:823888
DOI10.1007/s12532-020-00192-5zbMath1476.90229arXiv1903.01786OpenAlexW3087977576MaRDI QIDQ823888
Yinyu Ye, Mingxi Zhu, Krešimir Mihić
Publication date: 16 December 2021
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.01786
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Subgroup-effects models for the analysis of personal treatment effects, RACQP, A linear algebra perspective on the random multi-block ADMM: the QP case
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- OSQP: An Operator Splitting Solver for Quadratic Programs
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Stochastic Quasi-Newton Method for Large-Scale Optimization
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- A splitting method for orthogonality constrained problems
- On the linear convergence of the alternating direction method of multipliers
- Exploiting separability in large-scale linear support vector machine training
- A computation study on an integrated alternating direction method of multipliers for large scale optimization
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- QAPLIB - a quadratic assignment problem library
- Partitioning mathematical programs for parallel solution
- An effective iterated tabu search for the maximum bisection problem
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Support-vector networks
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
- Tensor principal component analysis via convex optimization
- Coordinate descent algorithms
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Pathwise coordinate optimization
- Multiplier and gradient methods
- PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Node-Based Learning of Multiple Gaussian Graphical Models
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Algorithms for nonlinear constraints that use lagrangian functions
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A repository of convex quadratic programming problems
- Consensus-ADMM for General Quadratically Constrained Quadratic Programming
- An ADMM-based interior-point method for large-scale linear programming
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent
- Online Decision Making with High-Dimensional Covariates
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
- Fast unfolding of communities in large networks
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
