Tibor Illés
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tibor Illés has a total of 68 co-authors. Here are the top co-authors by number of shared publications:
- Tamás Terlaky
Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, USA
12 shared publications - Petra Renáta Rigó
Corvinus Centre for Operations Research at Corvinus Institute for Advanced Studies, Corvinus University of Budapest, 1093 Budapest, Hungary
8 shared publications - Etienne de Klerk
Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Netherlands
3 shared publications - Marianna E.-Nagy
Corvinus Centre for Operations Research at Corvinus Institute for Advanced Studies, Corvinus University of Budapest, 1093 Budapest, Hungary
3 shared publications Zsolt Csizmadia
FICO UK
3 shared publicationsA.J. Quist
Faculty of Information Technology and Systems, Delft University of Technology , Delft, The Netherlands
2 shared publications
Latest Publications
- 12 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
In this paper, we introduce two parabolic target-space interior-point algorithms for solving monotone linear complementarity problems (LCPs). The first algorithm is based on a universal tangent direction, which has been recently proposed for linear optimization problems. We prove that this method has the best-known worst-case complexity bound. We extend onto this LCP its auto-correcting version proposed by Nesterov and prove its local quadratic convergence under the assumption of the existence of a unique and strictly complementarity solution. In our numerical experiments, we compare the new algorithms with a general method, recently developed for weighted monotone linear complementarity problems. Funding: This research was supported by the National Research, Development and Innovation Office (NKFIH) [Grant 2024-1.2.3-HU-RIZONT-2024-00030]. The research of M. E.-Nagy and P. R. Rigó was individually supported by the János Bolyai Research Scholarship of the Hungarian Academy of Sciences (Magyar Tudományos Akadémia) [Grants 2024-2027 and 2025-2028, respectively].
- 12 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
In this paper, we introduce two parabolic target-space interior-point algorithms for solving monotone linear complementarity problems (LCPs). The first algorithm is based on a universal tangent direction, which has been recently proposed for linear optimization problems. We prove that this method has the best-known worst-case complexity bound. We extend onto this LCP its auto-correcting version proposed by Nesterov and prove its local quadratic convergence under the assumption of the existence of a unique and strictly complementarity solution. In our numerical experiments, we compare the new algorithms with a general method, recently developed for weighted monotone linear complementarity problems. Funding: This research was supported by the National Research, Development and Innovation Office (NKFIH) [Grant 2024-1.2.3-HU-RIZONT-2024-00030]. The research of M. E.-Nagy and P. R. Rigó was individually supported by the János Bolyai Research Scholarship of the Hungarian Academy of Sciences (Magyar Tudományos Akadémia) [Grants 2024-2027 and 2025-2028, respectively].
- Open Access
- 2 August 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (1) , 53-67
New computable algorithms for smooth multiobjective optimization problems
- 2 August 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (1) , 53-67
Open AccessNew computable algorithms for smooth multiobjective optimization problems
- Open Access
- 12 August 2025
- Published by Springer Nature in Mathematical Programming
- Vol. 219 (1-2) , 1-30
Parabolic target-space interior-point algorithm for monotone weighted linear complementarity problem
We revisit the main principles for constructing polynomial-time primal-dual interior-point algorithms (IPAs). We investigate the weighted Linear Complementarity Problem (WLCP), by extending the framework of Parabolic Target Space (PTS), proposed by Nesterov (2008) for primal-dual Linear Programming (LP) Problems. This approach has several advantages. The proposed method based on the PTS approach starts from an arbitrary strictly feasible primal-dual pair and follows a single central path toward the solution. It has the best known worst-case complexity bound. Finally, it works in a large neighborhood of the deviated central path, allowing very large steps. The latter ability results in a significant acceleration at the end of the process, confirmed by our preliminary computational experiments.
- 12 August 2025
- Published by Springer Nature in Mathematical Programming
- Vol. 219 (1-2) , 1-30
Open AccessParabolic target-space interior-point algorithm for monotone weighted linear complementarity problem
We revisit the main principles for constructing polynomial-time primal-dual interior-point algorithms (IPAs). We investigate the weighted Linear Complementarity Problem (WLCP), by extending the framework of Parabolic Target Space (PTS), proposed by Nesterov (2008) for primal-dual Linear Programming (LP) Problems. This approach has several advantages. The proposed method based on the PTS approach starts from an arbitrary strictly feasible primal-dual pair and follows a single central path toward the solution. It has the best known worst-case complexity bound. Finally, it works in a large neighborhood of the deviated central path, allowing very large steps. The latter ability results in a significant acceleration at the end of the process, confirmed by our preliminary computational experiments.
- Open Access
- 12 June 2025
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 53 (3) , 485-493
Multiple Faces of Optimization
- 12 June 2025
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 53 (3) , 485-493
Open AccessMultiple Faces of Optimization
- 11 July 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 1-10
Conic Optimization and Interior Point Methods: Theory, Computations, and Applications
- 11 July 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 1-10
Conic Optimization and Interior Point Methods: Theory, Computations, and Applications
- Open Access
New computable algorithms for smooth multiobjective optimization problems
We propose new practical algorithms for solving smooth multiobjective optimization problems based on determining joint decreasing directions via suitable linear programming problems. The presented iterative method is specialized for unconstrained, sign constrained and linearly constrained multiobjective optimization problems. In all cases we show that the objective function values sequence is decreasing with respect to the considered nonnegative orthant while the iterates are feasible. Furthermore, we prove that every accumulation point of the sequence generated by the algorithm, if any, is a substationary point to the considered multiobjective optimization problem, and, under convexity assumptions, it is actually a weakly Pareto efficient (also known as weakly Pareto-optimal) point. Different to similar algorithms from the literature, the ones proposed in this work involve joint decreasing directions that are easily computable in polynomial time by solving linear programming problems. The computational performance of our algorithms has been illustrated on convex unconstrained and convex linearly constrained multiobjective optimization problems.
Open AccessNew computable algorithms for smooth multiobjective optimization problems
We propose new practical algorithms for solving smooth multiobjective optimization problems based on determining joint decreasing directions via suitable linear programming problems. The presented iterative method is specialized for unconstrained, sign constrained and linearly constrained multiobjective optimization problems. In all cases we show that the objective function values sequence is decreasing with respect to the considered nonnegative orthant while the iterates are feasible. Furthermore, we prove that every accumulation point of the sequence generated by the algorithm, if any, is a substationary point to the considered multiobjective optimization problem, and, under convexity assumptions, it is actually a weakly Pareto efficient (also known as weakly Pareto-optimal) point. Different to similar algorithms from the literature, the ones proposed in this work involve joint decreasing directions that are easily computable in polynomial time by solving linear programming problems. The computational performance of our algorithms has been illustrated on convex unconstrained and convex linearly constrained multiobjective optimization problems.
- Open Access
- 17 August 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 204-236
Sufficient Matrices: Properties, Generating and Testing
This paper investigates various aspects of sufficient matrices, one of the most relevant matrix classes introduced in connection with linear complementarity problems. We summarize the most important theoretical results and properties related to sufficient matrices. Based on these, we propose different construction rules that can be used to generate new matrices that belong to this class. A nonnegative number can be assigned to each sufficient matrix, which is called its handicap and works as a measure of sufficiency. The handicap plays a crucial role in proving convergence and complexity results for interior point algorithms for linear complementarity problems. For a particular sufficient matrix, called Csizmadia’s matrix, we give the exact value of the handicap, which is exponential in the size of the matrix. Another important topic that we address is deciding whether a matrix is sufficient. Tseng proved in 2000 that this decision problem is co-NP hard. We investigate three different algorithms for determining the sufficiency of a given matrix: Väliaho’s algorithm, a linear programming-based algorithm, and an algorithm that facilitates nonlinear programming reformulations of the definition of sufficiency. We tested the efficiency of these methods on our recently launched benchmark data set that consists of four different sets of matrices. In this paper, we give the description and most important properties of the benchmark set, which can be used in the future to compare the performance of different interior point algorithms for linear complementarity problems.
- 17 August 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 204-236
Open AccessSufficient Matrices: Properties, Generating and Testing
This paper investigates various aspects of sufficient matrices, one of the most relevant matrix classes introduced in connection with linear complementarity problems. We summarize the most important theoretical results and properties related to sufficient matrices. Based on these, we propose different construction rules that can be used to generate new matrices that belong to this class. A nonnegative number can be assigned to each sufficient matrix, which is called its handicap and works as a measure of sufficiency. The handicap plays a crucial role in proving convergence and complexity results for interior point algorithms for linear complementarity problems. For a particular sufficient matrix, called Csizmadia’s matrix, we give the exact value of the handicap, which is exponential in the size of the matrix. Another important topic that we address is deciding whether a matrix is sufficient. Tseng proved in 2000 that this decision problem is co-NP hard. We investigate three different algorithms for determining the sufficiency of a given matrix: Väliaho’s algorithm, a linear programming-based algorithm, and an algorithm that facilitates nonlinear programming reformulations of the definition of sufficiency. We tested the efficiency of these methods on our recently launched benchmark data set that consists of four different sets of matrices. In this paper, we give the description and most important properties of the benchmark set, which can be used in the future to compare the performance of different interior point algorithms for linear complementarity problems.
- Open Access
- 4 August 2023
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 11
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- 4 August 2023
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 11
Open AccessLarge-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- Open Access
- 9 June 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 27-49
Unified Approach of Interior-Point Algorithms for $P_*(\kappa )$-LCPs Using a New Class of Algebraically Equivalent TransformationsWe propose new short-step interior-point algorithms (IPAs) for solving $$P_*(\kappa )$$ -linear complementarity problems (LCPs). In order to define the search directions, we use the algebraic equivalent transformation (AET) technique of the system describing the central path. A novelty of the paper is that we introduce a whole, new class of AET functions for which a unified complexity analysis of the IPAs is presented. This class of functions differs from the ones used in the literature for determining search directions, like the class of concave functions determined by Haddou, Migot and Omer, self-regular functions, eligible kernel and self-concordant functions. We prove that the IPAs using any member $$\varphi $$ of the new class of AET functions have polynomial iteration complexity in the size of the problem, in starting point’s duality gap, in the accuracy parameter and in the parameter $$\kappa $$ .- 9 June 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 27-49
Open AccessUnified Approach of Interior-Point Algorithms for $P_*(\kappa )$-LCPs Using a New Class of Algebraically Equivalent TransformationsWe propose new short-step interior-point algorithms (IPAs) for solving $$P_*(\kappa )$$ -linear complementarity problems (LCPs). In order to define the search directions, we use the algebraic equivalent transformation (AET) technique of the system describing the central path. A novelty of the paper is that we introduce a whole, new class of AET functions for which a unified complexity analysis of the IPAs is presented. This class of functions differs from the ones used in the literature for determining search directions, like the class of concave functions determined by Haddou, Migot and Omer, self-regular functions, eligible kernel and self-concordant functions. We prove that the IPAs using any member $$\varphi $$ of the new class of AET functions have polynomial iteration complexity in the size of the problem, in starting point’s duality gap, in the accuracy parameter and in the parameter $$\kappa $$ .