An ADMM algorithm for solving a proximal bound-constrained quadratic program

We consider a proximal operator given by a quadratic function subject to bound constraints and give an optimization algorithm using the alternating direction method of multipliers (ADMM). The algorithm is particularly efficient to solve a collection of proximal operators that share the same quadratic form, or if the quadratic program is the relaxation of a binary quadratic problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2021

Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers

In this paper, we consider a prototypical convex optimization problem wi...
research
04/02/2021

Solving Large Scale Quadratic Constrained Basis Pursuit

Inspired by alternating direction method of multipliers and the idea of ...
research
07/25/2014

Dissimilarity-based Sparse Subset Selection

Finding an informative subset of a large collection of data points or mo...
research
05/16/2017

Learning Convex Regularizers for Optimal Bayesian Denoising

We propose a data-driven algorithm for the maximum a posteriori (MAP) es...
research
04/06/2022

Unconstrained Proximal Operator: the Optimal Parameter for the Douglas-Rachford Type Primal-Dual Methods

In this work, we propose an alternative parametrized form of the proxima...
research
05/09/2018

Presburger Arithmetic with algebraic scalar multiplications

We study complexity of integer sentences in S_α = (R, <, +,Z, x α x), wh...
research
02/23/2016

Learning Shapes by Convex Composition

We present a mathematical and algorithmic scheme for learning the princi...

Please sign up or login with your details

Forgot password? Click here to reset