#### Filter Results:

- Full text PDF available (149)

#### Publication Year

1987

2017

- This year (5)
- Last 5 years (22)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tamás Terlaky
- European Journal of Operational Research
- 1998

- Aharon Ben-Tal, Laurent El Ghaoui, +14 authors ROBook May
- 2004

We propose new methodologies in robust optimization that promise greater tractability, both theoretically and practically than the classical robust framework. We cover a broad range of mathematical optimization problems, including linear optimization (LP), quadratic constrained quadratic optimization (QCQP), general conic optimization including second order… (More)

- Kees Roos, Tamás Terlaky, Jean-Philippe Vial
- Wiley-Interscience series in discrete mathematics…
- 1998

Interestingly, theory and algorithms for linear optimization an interior point approach that you really wait for now is coming. It's significant to wait for the representative and beneficial books to read. Every book that is provided in better way and utterance will be expected by many peoples. Even you are a good reader or not, feeling to read this book… (More)

- Erling D. Andersen, Kees Roos, Tamás Terlaky
- Math. Program.
- 2003

Conic quadratic optimization is the problem of minimizing a linear function subject to the intersection of an affine set and the product of quadratic cones. The problem is a convex optimization problem and has numerous applications in engineering, economics, and other areas of science. Indeed, linear and convex quadratic optimization is a special case.… (More)

- Arkadi Nemirovski, Kees Roos, Tamás Terlaky
- Math. Program.
- 1999

We demonstrate that if A1; :::; Am are symmetric positive semide nite n n matrices with positive de nite sum and A is an arbitrary symmetric n n matrix, then the quality of the semide nite relaxation max X fTr(AX) j Tr(AiX) 1; i = 1; :::;m; X 0g (SDP) of the optimization program xTAx! max j xTAix 1; i = 1; :::;m (P) is not worse than 1 2 ln(2m2) . It is… (More)

- Imre Pólik, Tamás Terlaky
- SIAM Review
- 2007

In this survey we review the many faces of the S-lemma, a result about the correctness of the S-procedure. The basic idea of this widely used method came from control theory but it has important consequences in quadratic and semidefinite optimization, convex geometry and linear algebra as well. These were active research areas, but as there was little… (More)

- Jiming Peng, Kees Roos, Tamás Terlaky
- Math. Program.
- 2002

- Benjamin Jansen, Kees Roos, Tamás Terlaky, Jean-Philippe Vial
- Math. Meth. of OR
- 1996

In this paper we propose a long{step target{following methodology for linear programming. This is a general framework, that enables us to analyze various long{step primal{dual algorithms in the literature in a short and uniform way. Among these are long{step central and weighted path{following methods and algorithms to compute a central point or a weighted… (More)

- Benjamin Jansen, Kees Roos, Tamás Terlaky
- Math. Oper. Res.
- 1996

No part of this report may be reproduced in any form, by print, photoprint, microolm or any other means without written permis

- Imre Pólik, Tamás Terlaky
- 2010