29 citations · 171 across the 24 of their papers we have counts for
10 papers · 1 filter
Characterization of Unique Solvability of Absolute Value Equations: An Overview, Extensions, and Future Directions
Shubham Kumar, Deepmala, Milan Hladik +1
This paper provides an overview of the necessary and sufficient conditions for guaranteeing the unique solvability of absolute value equations. In addition to discussing the basic…
Error bounds and a condition number for the absolute value equations
Moslem Zamani, Milan Hladic
Absolute value equations, due to their relation to the linear complementarity problem, have been intensively studied recently. In this paper, we present error bounds for absolute v…
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…
Stability of the linear complementarity problem properties under interval uncertainty
Milan Hladík
We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity pr…
Interval Linear Programming under Transformations: Optimal Solutions and Optimal Value Range
Elif Garajová, Milan Hladík, Miroslav Rada
Interval linear programming provides a tool for solving real-world optimization problems under interval-valued uncertainty. Instead of approximating or estimating crisp input data,…
Duality Gap in Interval Linear Programming
Jana Novotná, Milan Hladík, Tomáš Masařík
This paper deals with the problem of linear programming with inexact data represented by real closed intervals. Optimization problems with interval data arise in practical computat…
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomial cases
Miroslav Rada, Milan Hladík, Elif Garajová
We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We di…
Selection-based Approach to Cooperative Interval Games
Jan Bok, Milan Hladík
Cooperative interval games are a generalized model of cooperative games in which the worth of every coalition corresponds to a closed interval representing the possible outcomes of…
Robust optimal solutions in interval linear programming with forall-exists quantifiers
Milan Hladík
We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of objective functions coefficients and constraint mat…
On the Efficient Gerschgorin Inclusion Usage in the Global Optimization αBB Method
Milan Hladík
In this paper, we revisit the αBB method for solving global optimization problems. We investigate optimality of the scaling vector used in Gerschgorin's inclusion theorem to calcul…