Follow
Marianna E.-Nagy
Marianna E.-Nagy
Verified email at uni-corvinus.hu
Title
Cited by
Cited by
Year
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
602007
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
462010
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
292009
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
282010
On the complexity of computing the handicap of a sufficient matrix
E de Klerk, M E.-Nagy
Mathematical programming 129 (2), 383-402, 2011
232011
Interior point algorithms for general linear complementarity problems
M Nagy
PhD thesis, Eötvös Loránd University of Sciences, Institute of Mathematics, 2009
162009
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
15*2013
On semidenite programming bounds for graph bandwidth
E de Klerk, M E.-Nagy, R Sotirov
Optimization Online, 2011
152011
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
112014
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
82014
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
32012
Complexity of the positive semidefinite matrix completion problem with a rank constraint.
M Eisenberg-Nagy, M Laurent, A Varvitsiotis
Springer, Fields Institute Communications, vol. 69, 2013
12013
Belsőpontos algoritmusok
T Illés, M Nagy, T Terlaky
Informatikai algoritmusok 2. köt., 1230-1297, 2005
12005
Informatikai algoritmusok 2.
L Bacsárdi, L Domoszlai, B Englert, C Fohry, M Galambos, T Gyires, ...
Budapest, 2015
2015
Expected Lifetime and Capacity
A Telcs, M E.-Nagy
Fractal Geometry and Stochastics, 327-340, 2015
2015
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
2012
Symmetry in RLT cuts for the quadratic assignment and standard quadratic optimization problems
E de Klerk, M E.-Nagy, R Sotirov, U Truetsch
Optimization Online, 2012
2012
An EP theorem for DLCP and interior point methods
T Illés, M Nagy, T Terlaky
SOR'07: The 9th International Symposium on Operational Research in Slovenia …, 2007
2007
Polynomial path-following interior point algorithim for general linear complimentarity problems
M Nagy, T Terlaky
University of Strathclyde, 2007
2007
The system can't perform the operation now. Try again later.
Articles 1–19