Følg
Marianna E.-Nagy
Marianna E.-Nagy
Verificeret mail på uni-corvinus.hu
Titel
Citeret af
Citeret af
År
A Mizuno–Todd–Ye type predictor–corrector algorithm for sufficient linear complementarity problems
T Illes, M Nagy
European Journal of Operational Research 181 (3), 1097-1111, 2007
652007
A polynomial path-following interior point algorithm for general linear complementarity problems
T Illés, M Nagy, T Terlaky
Journal of Global Optimization 47 (3), 329-342, 2010
552010
Polynomial Interior Point Algorithms for General Linear Complementarity Problems
T Illés, M Nagy, T Terlaky
Algorithmic Operations Research 5 (1), Pages 1-12, 2010
332010
EP theorem for dual linear complementarity problems
T Illés, M Nagy, T Terlaky
Journal of optimization theory and applications 140 (2), 233-238, 2009
322009
On the complexity of computing the handicap of a sufficient matrix
E de Klerk, M E.-Nagy
Mathematical programming 129 (2), 383-402, 2011
302011
Interior point algorithms for general linear complementarity problems
M Nagy
PhD thesis, Eötvös Loránd University of Sciences, Institute of Mathematics, 2009
212009
On semidenite programming bounds for graph bandwidth
E de Klerk, M E.-Nagy, R Sotirov
Optimization Online, 2011
162011
The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem
T Illés, M Nagy
Eötvös Loránd University of Sciences, 2004
122004
Complexity of the positive semidefinite matrix completion problem with a rank constraint
M Eisenberg-Nagy, M Laurent, A Varvitsiotis
arXiv preprint arXiv:1203.6602, 2012
112012
Mixed integer linear programming formulation for K-means clustering problem
KC Ágoston, M E.-Nagy
Central European Journal of Operations Research 32 (1), 11-27, 2024
92024
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
M E.-Nagy, M Laurent, A Varvitsiotis
Journal of Combinatorial Theory, Series B 108, 40-80, 2014
92014
Complexity of the positive semidefinite matrix completion problem with a rank constraint
M E.-Nagy, M Laurent, A Varvitsiotis
Discrete Geometry and Optimization, 105-120, 2013
9*2013
A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
M E.-Nagy, A Varga
Central European Journal of Operations Research 31 (3), 691-711, 2023
72023
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
E de Klerk, M E.-Nagy, R Sotirov, U Truetsch
European Journal of Operational Research 233 (3), 488-499, 2014
72014
A new Ai–Zhang type interior point algorithm for sufficient linear complementarity problems
M E.-Nagy, A Varga
Journal of Optimization Theory and Applications 202 (1), 76-107, 2024
42024
Sufficient matrices: properties, generating and testing
M E.-Nagy, T Illés, J Povh, A Varga, J Žerovnik
Journal of Optimization Theory and Applications 202 (1), 204-236, 2024
42024
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices.
M E.-Nagy, M Laurent, A Varvitsiotis
arXiv. org e-Print archive, 2012
4*2012
Belsőpontos algoritmusok
T Illés, M Nagy, T Terlaky
Informatikai algoritmusok 2. köt., 1230-1297, 2005
12005
Overview of Hungarian operations research based on the VOCAL 2022 conference
B Bertok, P Biró, M E.-Nagy
Central European Journal of Operations Research 32 (4), 897-902, 2024
2024
Computing a common prior
M E.-Nagy, M Pintér
2024
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20