Cornelis Roos

Publication Activity (10 Years)

Years Active: 1979-2016
Publications (10 Years): 1

Top Topics

Computationally Intensive

Quadratically Constrained Quadratic

Quadratic Program

Semi Definite Programming

Top Venues

J. Optim. Theory Appl.

Publications

Alireza Asadi, Cornelis Roos
Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood. J. Optim. Theory Appl. 170 (2) (2016)
Guoyong Gu, Maryam Zangiabadi, Cornelis Roos
Full Nesterov-Todd step infeasible interior-point method for symmetric optimization. Eur. J. Oper. Res. 214 (3) (2011)
Goran Lesaja, Cornelis Roos
Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones. J. Optim. Theory Appl. 150 (3) (2011)
Olof Heden, Cornelis Roos
The non-existence of some perfect codes over non-prime power alphabets. Discret. Math. 311 (14) (2011)
Guoyong Gu, Cornelis Roos
Counterexample to a Conjecture on an Infeasible Interior-Point Method. SIAM J. Optim. 20 (4) (2010)
Alireza Asadi, Guoyong Gu, Cornelis Roos
Convergence of the homotopy path for a full-Newton step infeasible interior-point method. Oper. Res. Lett. 38 (2) (2010)
Goran Lesaja, Cornelis Roos
-Linear Complementarity Problems. SIAM J. Optim. 20 (6) (2010)
Mohamed El Ghami, Cornelis Roos, Trond Steihaug
A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions. Optim. Methods Softw. 25 (3) (2010)
Hossein Mansouri, Cornelis Roos
) infeasible interior-point algorithm for semidefinite optimization. Numer. Algorithms 52 (2) (2009)
Mohamed El Ghami, Yan-Qin Bai, Cornelis Roos
Kernel-function Based Algorithms for Semidefinite Optimization. RAIRO Oper. Res. 43 (2) (2009)
Mohamed El Ghami, Ivan Ivanov, Hans Melissen, Cornelis Roos, Trond Steihaug
Primal-dual algorithm for linear optimization problems based on a new class of kernel functions. ISCC (2008)
Mohamed El Ghami, Cornelis Roos
Generic Primal-dual Interior Point Methods Based on a New Kernel Function. RAIRO Oper. Res. 42 (2) (2008)
Cornelis Roos
A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization. SIAM J. Optim. 16 (4) (2006)
Diah Chaerani, Cornelis Roos
Modelling Some Robust Design Problems via Conic Optimization. OR (2006)
Guo-Qiang Wang, Yan-Qin Bai, Cornelis Roos
Primal-Dual Interior-Point Algorithms for Semidefinite Optimization Based on a Simple Kernel Function. J. Math. Model. Algorithms 4 (4) (2005)
Margaréta Halická, Etienne de Klerk, Cornelis Roos
Limiting behavior of the central path in semidefinite optimization. Optim. Methods Softw. 20 (1) (2005)
Yan-Qin Bai, Mohamed El Ghami, Cornelis Roos
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization. SIAM J. Optim. 15 (1) (2004)
Diah Chaerani, Cornelis Roos, A. Aman
The Robust Shortest Path Problem by Means of Robust Linear Optimization. OR (2004)
Yan-Qin Bai, Cornelis Roos
A polynomial-time algorithm for linear optimization based on a new simple kernel function. Optim. Methods Softw. 18 (6) (2003)
Cornelis Roos, Jianzhong Zhang
Foreword. Optim. Methods Softw. 18 (6) (2003)
Aharon Ben-Tal, Arkadi Nemirovski, Cornelis Roos
Extended Matrix Cube Theorems with Applications to µ-Theory in Control. Math. Oper. Res. 28 (3) (2003)
Erling D. Andersen, Cornelis Roos, Tamás Terlaky
On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Program. 95 (2) (2003)
Yan-Qin Bai, Mohamed El Ghami, Cornelis Roos
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier. SIAM J. Optim. 13 (3) (2002)
Jiming Peng, Cornelis Roos, Tamás Terlaky
A new class of polynomial primal-dual methods for linear and semidefinite optimization. Eur. J. Oper. Res. 143 (2) (2002)
Jiming Peng, Cornelis Roos, Tamás Terlaky
Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program. 93 (1) (2002)
Jiming Peng, Cornelis Roos, Tamás Terlaky
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities. SIAM J. Optim. 13 (1) (2002)
Tibor Illés, Jiming Peng, Cornelis Roos, Tamás Terlaky
Linear Complementarity Problems. SIAM J. Optim. 11 (2) (2000)
Immanuel M. Bomze, Mirjam Dür, Etienne de Klerk, Cornelis Roos, Arie J. Quist, Tamás Terlaky
On Copositive Programming and Standard Quadratic Optimization Problems. J. Glob. Optim. 18 (4) (2000)
Cornelis Roos, Tamás Terlaky
Note on a paper of Broyden. Oper. Res. Lett. 25 (4) (1999)
Arkadi Nemirovski, Cornelis Roos, Tamás Terlaky
On maximization of quadratic form over intersection of ellipsoids with common center. Math. Program. 86 (3) (1999)
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
A nonconvex weighted potential function forpolynomial target following methods. Ann. Oper. Res. 81 (1998)
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. J. Comb. Optim. 2 (1) (1998)
Cornelis Roos, A. Snijders, A. J. van Zanten
Cyclonomial Number Systems and the Ranking of Lexicographically Ordered Constant-Sum Codes. Ars Comb. 48 (1998)
Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen
Potential reduction algorithms for structured combinatorial optimization problems. Oper. Res. Lett. 21 (2) (1997)
Etienne de Klerk, Cornelis Roos, Tamás Terlaky, Tibor Illés, A. J. de Jong, J. Valkó, J. E. Hoogenboom
Optimization of nuclear reactor reloading patterns. Ann. Oper. Res. 69 (1997)
Benjamin Jansen, Cornelis Roos, Tamás Terlaky
A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems. SIAM J. Optim. 7 (1) (1997)
Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen
A Potential Reduction Approach to the Frequency Assignment Problem. Discret. Appl. Math. 78 (1-3) (1997)
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Oper. Res. Lett. 20 (5) (1997)
Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial
Primal-dual target-following algorithms for linear programming. Ann. Oper. Res. 62 (1) (1996)
Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial
Long-step primal-dual target-following algorithms for linear programming. Math. Methods Oper. Res. 44 (1) (1996)
Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky
A Long-Step Barrier Method for Convex Quadratic Programming. Algorithmica 10 (5) (1993)
Osman Güler, Dick den Hertog, Cornelis Roos, Tamás Terlaky, Takashi Tsuchiya
Degeneracy in interior point methods for linear programming: a survey. Ann. Oper. Res. (1) (1993)
Dick den Hertog, Cornelis Roos, Jean-Philippe Vial
A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming. SIAM J. Optim. 2 (1) (1992)
Dick den Hertog, Cornelis Roos, Tamás Terlaky
A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems. SIAM J. Optim. 2 (1) (1992)
Cornelis Roos
A new lower bound for the minimum distance of a cyclic code. IEEE Trans. Inf. Theory 29 (3) (1983)
Cornelis Roos, A. J. van Zanten
On the existence of certain distance-regular graphs. J. Comb. Theory, Ser. B 33 (3) (1982)
Cornelis Roos
On t-constant codes and designs. IEEE Trans. Inf. Theory 27 (5) (1981)
Cornelis Roos
On the structure of convolutional and cyclic convolutional codes. IEEE Trans. Inf. Theory 25 (6) (1979)