Cornelis Roos

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