60 citations · 61 across the 5 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2019★ 1 cited
A new polynomially solvable class of quadratic optimization problems with box constraints
Milan Hladík, Michal Černý, Miroslav Rada
We consider the quadratic optimization problem , where is a box and is assumed to be $\mathcal{O}(…
math.OC2019
A class of optimization problems motivated by rank estimators in robust regression
Michal Cerny, Miroslav Rada, Jaromir Antoch +1
A rank estimator in robust regression is a minimizer of a function which depends (in addition to other factors) on the ordering of residuals but not on their values. Here we focus…