C. Roos
C. Roos
Dirección de correo verificada de tudelft.nl - Página principal
TítuloCitado porAño
Theory and algorithms for linear optimization: an interior point approach
C Roos, T Terlaky, JP Vial
John Wiley & Son Ltd, 1997
8191997
On implementing a primal-dual interior-point method for conic quadratic optimization
ED Andersen, C Roos, T Terlaky
Mathematical Programming 95 (2), 249-277, 2003
4952003
Self-regularity: a new paradigm for primal-dual interior-point algorithms
J Peng, C Roos, T Terlaky
Princeton University Press, 2009
3062009
A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization
YQ Bai, M El Ghami, C Roos
SIAM Journal on Optimization 15 (1), 101-128, 2004
2602004
Interior point methods for linear optimization
C Roos, T Terlaky, JP Vial
Springer Science & Business Media, 2005
2512005
Self-regular functions and new search directions for linear and semidefinite optimization
J Peng, C Roos, T Terlaky
Mathematical Programming 93 (1), 129-171, 2002
2412002
Robust solutions of uncertain quadratic and conic-quadratic problems
A Ben-Tal, A Nemirovski, C Roos
SIAM Journal on Optimization 13 (2), 535-560, 2002
2252002
On copositive programming and standard quadratic optimization problems
IM Bomze, M Dür, E De Klerk, C Roos, AJ Quist, T Terlaky
Journal of Global Optimization 18 (4), 301-320, 2000
1802000
On maximization of quadratic form over intersection of ellipsoids with common center
A Nemirovski, C Roos, T Terlaky
Mathematical Programming 86 (3), 463-473, 1999
1781999
Sensitivity analysis in linear programming: just be careful!
B Jansen, JJ De Jong, C Roos, T Terlaky
European Journal of Operational Research 101 (1), 15-28, 1997
1611997
A full-Newton step O (n) infeasible interior-point algorithm for linear optimization
C Roos
SIAM Journal on Optimization 16 (4), 1110-1136, 2006
1592006
A polynomial method of approximate centers for linear programming
C Roos, JP Vial
Mathematical Programming 54 (1-3), 295-305, 1992
1411992
A new efficient large-update primal-dual interior-point method based on a finite barrier
YQ Bai, M El Ghami, C Roos
SIAM Journal on Optimization 13 (3), 766-782, 2002
1342002
A new lower bound for the minimum distance of a cyclic code
C Roos
IEEE Transactions on Information Theory 29 (3), 330-332, 1983
1011983
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
E de Klerk, C Roos, T Terlaky
Operations Research Letters 20 (5), 213-221, 1997
991997
On the convergence of the central path in semidefinite optimization
M Halická, E de Klerk, C Roos
SIAM Journal on Optimization 12 (4), 1090-1099, 2002
982002
Cramer and Cayley-Hamilton in the max algebra
GJ Olsder, C Roos
Linear Algebra and its Applications 101, 87-108, 1988
981988
A survey of search directions in interior point methods for linear programming
D den Hertog, C Roos
Mathematical Programming 52 (1-3), 481-509, 1991
961991
On the classical logarithmic barrier function method for a class of smooth convex programming problems
D Den Hertog, C Roos, T Terlaky
Journal of Optimization Theory and Applications 73 (1), 1-25, 1992
901992
Full Nesterov–Todd step infeasible interior-point method for symmetric optimization
G Gu, M Zangiabadi, C Roos
European Journal of Operational Research 214 (3), 473-484, 2011
852011
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20