10 citations · 13 across the 7 of their papers we have counts for
4 papers · 1 filter
Walks on hyperplane arrangements and optimization of piecewise linear functions
Michal Černý, Milan Hladík, Miroslav Rada
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated b…
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}(…
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…
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with high probability
Miroslav Rada, Michal Černý, Ondřej Sokol
We consider the algorithm by Ferson et al. (Reliable computing 11(3), p. 207-233, 2005) designed for solving the NP-hard problem of computing the maximal sample variance over inter…