Separable Convex Optimization with Nested Lower and Upper Constraints

arXiv1703.01484MaRDI QIDQ6283891FDOQ6283891

Authors: T. Vidal, Daniel Gribel, Patrick Jaillet 

Publication date: 4 March 2017

Abstract: We study a convex resource allocation problem in which lower and upper bounds are imposed on partial sums of allocations. This model is linked to a large range of applications, including production planning, speed optimization, stratified sampling, support vector machines, portfolio management, and telecommunications. We propose an efficient gradient-free divide-and-conquer algorithm, which uses monotonicity arguments to generate valid bounds from the recursive calls, and eliminate linking constraints based on the information from sub-problems. This algorithm does not need strict convexity or differentiability. It produces an $epsilon$-approximate solution for the continuous problem in $mathcalO(nlogmlogfracnBepsilon)$ time and an integer solution in $mathcalO(nlogmlogB)$ time, where $n$ is the number of decision variables, $m$ is the number of constraints, and $B$ is the resource bound. A complexity of $mathcalO(nlogm)$ is also achieved for the linear and quadratic cases. These are the best complexities known to date for this important problem class. Our experimental analyses confirm the good performance of the method, which produces optimal solutions for problems with up to 1,000,000 variables in a few seconds. Promising applications to the support vector ordinal regression problem are also investigated.

This page was built for publication: Separable Convex Optimization with Nested Lower and Upper Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283891)