Tibor Illés
Orcid: 0000-0002-8789-6211
According to our database1,
Tibor Illés
authored at least 30 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Unified Approach of Interior-Point Algorithms for P<sub>*(κ</sub> )-LCPs Using a New Class of Algebraically Equivalent Transformations.
J. Optim. Theory Appl., July, 2024
Conic Optimization and Interior Point Methods: Theory, Computations, and Applications.
J. Optim. Theory Appl., July, 2024
J. Optim. Theory Appl., July, 2024
2023
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation.
EURO J. Comput. Optim., January, 2023
2022
Predictor-corrector interior-point algorithm for P*(κ)-linear complementarity problems based on a new type of algebraic equivalent transformation technique.
Eur. J. Oper. Res., 2022
EUR<i>O</i>pt, the Continuous Optimization Working Group of EURO: From idea to maturity.
EURO J. Comput. Optim., 2022
2021
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation.
Optim. Lett., 2021
2020
Feasible Corrector-Predictor Interior-Point Algorithm for P<sub>*</sub> (κ)-Linear Complementarity Problems Based on a New Search Direction.
SIAM J. Optim., 2020
A corrector-predictor interior-point method with new search direction for linear optimization.
Central Eur. J. Oper. Res., 2020
2019
2018
Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied.
Central Eur. J. Oper. Res., 2018
2016
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems.
Discret. Appl. Math., 2016
2015
2012
Eur. J. Oper. Res., 2012
2010
A polynomial path-following interior point algorithm for general linear complementarity problems.
J. Glob. Optim., 2010
Algorithmic Oper. Res., 2010
2008
17th EURO Mini Conference "Continuous Optimization in the Industry", Pécs, Hungary, June 29-July 1, 2005.
Eur. J. Oper. Res., 2008
2007
Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems.
Optim. Methods Softw., 2007
A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems.
Eur. J. Oper. Res., 2007
2006
New criss-cross type algorithms for linear complementarity problems with sufficient matrices.
Optim. Methods Softw., 2006
2005
Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 2005
2004
International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001).
Eur. J. Oper. Res., 2004
New variants of the criss-cross method for linearly constrained convex quadratic programming.
Eur. J. Oper. Res., 2004
2002
2001
J. Heuristics, 2001
2000
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P<sub>*(kappa)</sub> Linear Complementarity Problems.
SIAM J. Optim., 2000
1999
1997