Person:317430: Difference between revisions

From MaRDI portal
Person:317430
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Tibor Illés to Tibor Illés: Duplicate
 
(No difference)

Latest revision as of 16:49, 8 December 2023

Available identifiers

zbMath Open illes.tiborWikidataQ102111404 ScholiaQ102111404MaRDI QIDQ317430

List of research outcomes





PublicationDate of PublicationType
Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations2024-09-02Paper
Sufficient matrices: properties, generating and testing2024-09-02Paper
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation2024-04-24Paper
EUR\(O\)pt, the continuous optimization working group of EURO: from idea to maturity2023-07-12Paper
Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique2022-02-22Paper
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation2021-05-05Paper
Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction2020-10-08Paper
A corrector-predictor interior-point method with new search direction for linear optimization2020-09-29Paper
Market exchange models and geometric programming2019-06-03Paper
https://portal.mardi4nfdi.de/entity/Q46152092019-02-01Paper
Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied2018-10-05Paper
https://portal.mardi4nfdi.de/entity/Q28342532016-11-25Paper
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems2016-09-30Paper
The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems2014-07-09Paper
On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds2014-05-02Paper
Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules2014-05-02Paper
https://portal.mardi4nfdi.de/entity/Q28673732013-12-11Paper
The \(s\)-monotone index selection rules for pivot algorithms of linear programming2012-12-29Paper
A polynomial path-following interior point algorithm for general linear complementarity problems2010-08-23Paper
EP theorem for dual linear complementarity problems2009-05-05Paper
https://portal.mardi4nfdi.de/entity/Q34993682008-05-29Paper
https://portal.mardi4nfdi.de/entity/Q54469572008-03-06Paper
Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems2008-01-18Paper
A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems2007-05-03Paper
https://portal.mardi4nfdi.de/entity/Q34288322007-03-29Paper
New criss-cross type algorithms for linear complementarity problems with sufficient matrices2006-07-13Paper
Sufficient optimality criterion for linearly constrained, separable concave minimization problems2005-10-18Paper
https://portal.mardi4nfdi.de/entity/Q48165262004-09-08Paper
https://portal.mardi4nfdi.de/entity/Q48155912004-09-07Paper
New variants of the criss-cross method for linearly constrained convex quadratic programming2004-08-16Paper
Entropy and Young programs: Relations and self-concordance.2004-01-13Paper
https://portal.mardi4nfdi.de/entity/Q44350412003-11-26Paper
Pivot versus interior point methods: Pros and cons2002-05-28Paper
Upper bounds on the covering number of Galois-planes with small order2001-09-03Paper
https://portal.mardi4nfdi.de/entity/Q27142552001-06-13Paper
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems2001-03-19Paper
The finite criss-cross method for hyperbolic programming2000-04-09Paper
Theorems of the alternative and optimality conditions for convexlike and general convexlike programming1999-06-10Paper
https://portal.mardi4nfdi.de/entity/Q42204781998-11-23Paper
https://portal.mardi4nfdi.de/entity/Q43848711998-04-13Paper
https://portal.mardi4nfdi.de/entity/Q43629841997-11-13Paper
Optimization of nuclear reactor reloading patterns1997-06-16Paper
https://portal.mardi4nfdi.de/entity/Q47643281995-09-27Paper
Pseudoconvex optimization for a special problem of paint industry1995-01-12Paper
https://portal.mardi4nfdi.de/entity/Q39828181992-06-26Paper
Optimality criteria for general unconstrained geometric programming problems1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38241201988-01-01Paper

Research outcomes over time

This page was built for person: Tibor Illés