output
20112026
most citedOptimization Problems for Machine Learning: A Survey

373 citations

Showing 2014 · math.OCShow all

6 papers · 2 filters

math.OC2014

Exploiting Packing Components in General-Purpose Integer Programming Solvers

Jakub Marecek

The problem of packing boxes into a large box is often a part of a larger problem. For example in furniture supply chain applications, one needs to decide what trucks to use to tra…

math.OC2014★ 14 cited

Matrix Completion under Interval Uncertainty

Jakub Marecek, Peter Richtarik, Martin Takac

Matrix completion under interval uncertainty can be cast as matrix completion with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-d…

math.OC2014★ 9 cited

Signalling and obfuscation for congestion control

Jakub Marecek, Robert Shorten, Jia Yuan Yu

We aim to reduce the social cost of congestion in many smart city applications. In our model of congestion, agents interact over limited resources after receiving signals from a ce…

math.OC2014★ 50 cited

Distributed Block Coordinate Descent for Minimizing Partially Separable Functions

Jakub Marecek, Peter Richtarik, Martin Takac

In this work we propose a distributed randomized block coordinate descent method for minimizing a convex function with a huge number of variables/coordinates. We analyze its comple…

math.OC2014★ 132 cited

Optimal Power Flow as a Polynomial Optimization Problem

Bissan Ghaddar, Jakub Marecek, Martin Mevissen

Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptot…

math.OC2014★ 11 cited

r-Extreme Signalling for Congestion Control

Jakub Marecek, Robert Shorten, Jia Yuan Yu

In many "smart city" applications, congestion arises in part due to the nature of signals received by individuals from a central authority. In the model of Marecek et al. [arXiv:14…