Related papers: A unified treatment of tractability for approximat…
We consider linear programs involving uncertain parameters and propose a new tractable robust counterpart which contains and generalizes several other models including the existing Affinely Adjustable Robust Counterpart and the Fully…
Quantum mechanical models and practical calculations often rely on some exactly solvable models like the Coulomb and the harmonic oscillator potentials. The $D$ dimensional generalized Coulomb potential contains these potentials as limiting…
In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is…
In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends(Thong et al, Numerical Algorithms. 78, 1045-1060 (2018)). We have reduced and refined some of their algorithm's…
A new sufficient condition is given for the sum of linear m-accretive operator and accretive operator one in a Hilbert space to be m-accretive. As an application, an extended result to the operator-norm error bound estimate for the…
Fixed-point equations with Lipschitz operators have been studied for more than a century, and are central to problems in mathematical optimization, game theory, economics, and dynamical systems, among others. When the Lipschitz constant of…
Despite the strong focus of regularization on ill-posed problems, the general construction of such methods has not been fully explored. Moreover, many previous studies cannot be clearly adapted to handle more complex scenarios, albeit the…
The classical $L^2$ estimate for the $\overline{\partial}$ operators is a basic tool in complex analysis of several variables. Naturally, it is expected to extend this estimate to infinite dimensional complex analysis, but this is a…
Positive operator measures (with values in the space of bounded operators on a Hilbert space) and their generalizations, mainly positive sesquilinear form measures, are considered with the aim of providing a framework for their generalized…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
We study fundamental clustering problems for incomplete data. Specifically, given a set of incomplete d-dimensional vectors (representing rows of a matrix), the goal is to complete the missing vector entries in a way that admits a…
This is the Habilitation Thesis manuscript presented at Besan\c{c}on on January 5, focusing on Matrix Analysis, Matrix Inequalities and Matrix Decompositions. There are also some topics in (Hilbert space) Operator Theory. The text should be…
A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
In this work, we consider the satisfiability problem in a logic that combines word equations over string variables denoting words of unbounded lengths, regular languages to which words belong and Presburger constraints on the length of…
A classic result of Lenstra [Math.~Oper.~Res.~1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameter being the number of variables. We extend this result by incorporating…
Convergence of operators acting on a given Hilbert space is an old and well studied topic in operator theory. The idea of introducing a related notion for operators acting on arying spaces is natural. However, it seems that the first…
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree of each term should be small (up to 10), and the number of…
We set up, at the abstract Hilbert space setting, the general question on when an inverse linear problem induced by an operator of Friedrichs type admits solutions belonging to (the closure of) the Krylov subspace associated to such…
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…
We study a variant of Set Cover where each element of the universe has some demand that determines how many times the element needs to be covered. Moreover, we examine two generalizations of this problem when a set can be included multiple…