Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Tibor Illés"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 11, Iss , Pp 100072- (2023)
We introduce a new predictor-corrector interior-point algorithm for solving P⁎(κ)-linear complementarity problems which works in a wide neighbourhood of the central path. We use the technique of algebraic equivalent transformation of the centering
Externí odkaz:
https://doaj.org/article/b758ea0012c34cc4a055566db89c2eef
Publikováno v:
EURO Journal on Computational Optimization, Vol 10, Iss , Pp 100036- (2022)
Externí odkaz:
https://doaj.org/article/e193ad19b3e54c4a8b1f5df1b08b246d
Autor:
Tibor Illés, Tamás Terlaky
Publikováno v:
EURO Journal on Computational Optimization, Vol 10, Iss , Pp 100033- (2022)
This brief note presents a personal recollection of the early history of EUROpt, the Continuous Optimization Working Group of EURO. This historical note details the events that happened before the formation of EUROpt Working Group and the first five
Externí odkaz:
https://doaj.org/article/7fe33ae7c4eb417dbc28557268718b9a
Publikováno v:
European Journal of Operational Research. 298:25-35
We propose a new predictor-corrector (PC) interior-point algorithm (IPA) for solving linear complementarity problem (LCP) with P * ( κ ) -matrices. The introduced IPA uses a new type of algebraic equivalent transformation (AET) on the centering equa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d94b2b548d9ca0ba32e68a26e2fe3b51
https://doi.org/10.1016/j.ejor.2021.08.039
https://doi.org/10.1016/j.ejor.2021.08.039
Publikováno v:
Optimization Letters. 15:357-376
We present a short-step interior-point algorithm (IPA) for sufficient linear complementarity problems (LCPs) based on a new search direction. An algebraic equivalent transformation (AET) is used on the centrality equation of the central path system a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48f2c83754257944dee3306fe0be8f03
https://doi.org/10.1007/s11590-020-01612-0
https://doi.org/10.1007/s11590-020-01612-0
Autor:
TIBOR, ILLÉS
Publikováno v:
Alkalmazott matematikai lapok; 2023, Vol. 40 Issue 1, p87-100, 14p
Publikováno v:
Central European Journal of Operations Research. 28:1123-1140
We introduce a feasible corrector–predictor interior-point algorithm (CP IPA) for solving linear optimization problems which is based on a new search direction. The search directions are obtained by using the algebraic equivalent transformation (AE
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::634c712611b6834e2d6d5193b57f40b5
https://doi.org/10.1007/s10100-019-00622-3
https://doi.org/10.1007/s10100-019-00622-3
We introduce a new feasible corrector-predictor (CP) interior-point algorithm (IPA), which is suitable for solving linear complementarity problem (LCP) with P*(k)-matrices. We use the method of algebraically equivalent transformation (AET) of the non
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0710b761bcdf0f771023c3810115001e
https://repozitorij.uni-lj.si/Dokument.php?id=136279&dn=
https://repozitorij.uni-lj.si/Dokument.php?id=136279&dn=
Publikováno v:
Central European Journal of Operations Research. 27:415-435
Finding the equilibrium solution of the Market Exchange Models is an interesting topic. Here we discuss some relationship of the Fisher type Homogenous Market Exchange Model and the Geometric Programming. We also discuss that the equilibrium solution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae0cb8658bcc1ad1612d1834e677d00a
https://doi.org/10.1007/s10100-018-0582-3
https://doi.org/10.1007/s10100-018-0582-3
Publikováno v:
Scopus-Elsevier
This paper considers the primal quadratic simplex method for linearly constrained convex quadratic programming problems. Finiteness of the algorithm is proven when $${\mathbf {s}}$$ -monotone index selection rules are applied. The proof is rather gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11ff993986230ad8fbfb515949804926
https://doi.org/10.1007/s10100-018-0523-1
https://doi.org/10.1007/s10100-018-0523-1