Domain-Driven Solver (DDS) Version 2.0: a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form

08/07/2019
by   Mehdi Karimi, et al.
0

Domain-Driven Solver (DDS) is a MATLAB-based software package for convex optimization problems in Domain-Driven form [Karimi and Tunçel, arXiv:1804.06925]. The current version of DDS accepts every combination of the following function/set constraints: (1) symmetric cones (LP, SOCP, and SDP); (2) quadratic constraints that are SOCP representable; (3) direct sums of an arbitrary collection of 2-dimensional convex sets defined as the epigraphs of univariate convex functions (including as special cases geometric programming and entropy programming); (4) generalized power cone; (5) epigraphs of matrix norms (including as a special case minimization of nuclear norm over a linear subspace); (6) vector relative entropy; (7) epigraphs of quantum entropy and quantum relative entropy; and (8) constraints involving hyperbolic polynomials. DDS is a practical implementation of the infeasible-start primal-dual algorithm designed and analyzed in [Karimi and Tunçel, arXiv:1804.06925]. This manuscript contains the users' guide, as well as theoretical results needed for the implementation of the algorithms. To help the users, we included many examples. We also discussed some implementation details and techniques we used to improve the efficiency and further expansion of the software to cover the emerging classes of convex optimization problems.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

11/21/2017

CVXR: An R Package for Disciplined Convex Optimization

CVXR is an R package that provides an object-oriented modeling language ...
02/16/2020

Convex Optimization on Functionals of Probability Densities

In information theory, some optimization problems result in convex optim...
05/02/2019

Disciplined Quasiconvex Programming

We present a composition rule involving quasiconvex functions that gener...
02/04/2014

UNLocBoX: A MATLAB convex optimization toolbox for proximal-splitting methods

Convex optimization is an essential tool for machine learning, as many o...
10/17/2014

Convex Optimization in Julia

This paper describes Convex, a convex optimization modeling framework in...
06/30/2020

Ideal formulations for constrained convex optimization problems with indicator variables

Motivated by modern regression applications, in this paper, we study the...
12/10/2018

Disciplined Geometric Programming

We introduce log-log convex programs, which are optimization problems wi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.