default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKees Roos
Cees Roos – Cornelis Roos
Person information
- affiliation: Delft University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2002
[b2]Jiming Peng, Cornelis Roos, Tamás Terlaky:
Self-regularity - a new paradigm for primal-dual interior-point algorithms. Princeton series in applied mathematics, Princeton University Press 2002, ISBN 978-0-691-09193-8, pp. I-XIII, 1-185- 1998
- [b1]Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial:
Theory and algorithms for linear optimization - an interior point approach. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1998, ISBN 978-0-471-95676-1, pp. I-XXIV, 1-482
Journal Articles
- 2022
- [j79]Zhang Wei, Kees Roos:
Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems. Optim. Methods Softw. 37(4): 1447-1470 (2022) - 2020
- [j78]Kees Roos
, Marleen Balvert, Bram L. Gorissen, Dick den Hertog:
A Universal and Structured Way to Derive Dual Optimization Problem Formulations. INFORMS J. Optim. 2(4): 229-255 (2020) - 2018
- [j77]Kees Roos:
An improved version of Chubanov's method for solving a homogeneous feasibility problem. Optim. Methods Softw. 33(1): 26-44 (2018) - 2017
- [j76]Carel Eijgenraam, Ruud Brekelmans, Dick den Hertog, Kees Roos:
Optimal Strategies for Flood Prevention. Manag. Sci. 63(5): 1644-1656 (2017) - 2016
- [j75]Alireza Asadi, Cornelis Roos:
Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood. J. Optim. Theory Appl. 170(2): 562-590 (2016) - 2015
- [j74]Cornelis Roos:
An Improved and Simplified Full-Newton Step O(n) Infeasible Interior-Point Method for Linear Optimization. SIAM J. Optim. 25(1): 102-114 (2015) - 2014
- [j73]Carel Eijgenraam, Jarl Kind, Carlijn Bak, Ruud Brekelmans, Dick den Hertog, Matthijs Duits, Kees Roos, Pieter Vermeer, Wim Kuijken:
Economically Efficient Standards to Protect the Netherlands Against Flooding. Interfaces 44(1): 7-21 (2014) - 2013
- [j72]Maryam Zangiabadi, Guoyong Gu, Cees Roos:
A Full Nesterov-Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization. J. Optim. Theory Appl. 158(3): 816-858 (2013) - 2012
- [j71]Ruud Brekelmans, Dick den Hertog, Kees Roos, Carel Eijgenraam:
Safe Dike Heights at Minimal Costs: The Nonhomogeneous Case. Oper. Res. 60(6): 1342-1355 (2012) - 2011
- [j70]Olof Heden, Cornelis Roos:
The non-existence of some perfect codes over non-prime power alphabets. Discret. Math. 311(14): 1344-1348 (2011) - [j69]Guoyong Gu, Maryam Zangiabadi, Cornelis Roos:
Full Nesterov-Todd step infeasible interior-point method for symmetric optimization. Eur. J. Oper. Res. 214(3): 473-484 (2011) - [j68]Goran Lesaja, Cornelis Roos:
Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones. J. Optim. Theory Appl. 150(3): 444-474 (2011) - 2010
- [j67]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): 387-403 (2010) - [j66]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): 147-151 (2010) - [j65]Guoyong Gu, Cornelis Roos:
Counterexample to a Conjecture on an Infeasible Interior-Point Method. SIAM J. Optim. 20(4): 1862-1867 (2010) - [j64]Goran Lesaja, Cornelis Roos:
Unified Analysis of Kernel-Based Interior-Point Methods for P*(Kappa)-Linear Complementarity Problems. SIAM J. Optim. 20(6): 3014-3039 (2010) - 2009
- [j63]Hossein Mansouri, Cornelis Roos:
A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization. Numer. Algorithms 52(2): 225-255 (2009) - [j62]Mohamed El Ghami, Yan-Qin Bai, Cornelis Roos:
Kernel-function Based Algorithms for Semidefinite Optimization. RAIRO Oper. Res. 43(2): 189-199 (2009) - 2008
- [j61]Mohamed El Ghami, Cornelis Roos:
Generic Primal-dual Interior Point Methods Based on a New Kernel Function. RAIRO Oper. Res. 42(2): 199-213 (2008) - 2007
- [j60]Hossein Mansouri, Cornelis Roos:
Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps. Optim. Methods Softw. 22(3): 519-530 (2007) - 2006
- [j59]Cornelis Roos:
A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization. SIAM J. Optim. 16(4): 1110-1136 (2006) - 2005
- [j58]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): 409-433 (2005) - [j57]Margaréta Halická, Etienne de Klerk, Cornelis Roos:
Limiting behavior of the central path in semidefinite optimization. Optim. Methods Softw. 20(1): 99-113 (2005) - 2004
- [j56]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): 101-128 (2004) - 2003
- [j55]Aharon Ben-Tal, Arkadi Nemirovski, Cornelis Roos:
Extended Matrix Cube Theorems with Applications to µ-Theory in Control. Math. Oper. Res. 28(3): 497-523 (2003) - [j54]Erling D. Andersen, Cornelis Roos, Tamás Terlaky:
On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Program. 95(2): 249-277 (2003) - [j53]Cornelis Roos, Jianzhong Zhang:
Foreword. Optim. Methods Softw. 18(6): 629 (2003) - [j52]Yan-Qin Bai, Cornelis Roos:
A polynomial-time algorithm for linear optimization based on a new simple kernel function. Optim. Methods Softw. 18(6): 631-646 (2003) - 2002
- [j51]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): 234-256 (2002) - [j50]Jiming Peng, Cornelis Roos, Tamás Terlaky:
Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program. 93(1): 129-171 (2002) - [j49]Yan-Qin Bai, Cees Roos, Mohamed El Ghami:
A primal-dual interior-point method for linear optimization based on a new proximity function. Optim. Methods Softw. 17(6): 985-1008 (2002) - [j48]Margaréta Halická, Etienne de Klerk, Cees Roos:
On the Convergence of the Central Path in Semidefinite Optimization. SIAM J. Optim. 12(4): 1090-1099 (2002) - [j47]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): 179-203 (2002) - [j46]Aharon Ben-Tal, Arkadi Nemirovski, Cees Roos:
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems. SIAM J. Optim. 13(2): 535-560 (2002) - [j45]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): 766-782 (2002) - 2001
- [j44]Etienne de Klerk, Jiming Peng, Cees Roos, Tamás Terlaky:
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization. SIAM J. Optim. 11(4): 870-888 (2001) - 2000
- [j43]Jiming Peng, Cees Roos, Tamás Terlaky:
New Complexity Analysis of the Primal - Dual Newton Method for Linear Optimization. Ann. Oper. Res. 99(1-4): 23-39 (2000) - [j42]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): 301-320 (2000) - [j41]Tibor Illés, Jiming Peng, Cornelis Roos, Tamás Terlaky:
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P*(kappa) Linear Complementarity Problems. SIAM J. Optim. 11(2): 320-340 (2000) - 1999
- [j40]Arjan Berkelaar, Benjamin Jansen, Kees Roos, Tamás Terlaky:
Basis- and partition identification for quadratic programming and linear complementarity problems. Math. Program. 86(2): 261-282 (1999) - [j39]Arkadi Nemirovski, Cornelis Roos, Tamás Terlaky:
On maximization of quadratic form over intersection of ellipsoids with common center. Math. Program. 86(3): 463-473 (1999) - [j38]Cornelis Roos, Tamás Terlaky:
Note on a paper of Broyden. Oper. Res. Lett. 25(4): 183-186 (1999) - 1998
- [j37]Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
A nonconvex weighted potential function forpolynomial target following methods. Ann. Oper. Res. 81: 3-14 (1998) - [j36]Cornelis Roos, A. Snijders, A. J. van Zanten:
Cyclonomial Number Systems and the Ranking of Lexicographically Ordered Constant-Sum Codes. Ars Comb. 48 (1998) - [j35]Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. J. Comb. Optim. 2(1): 51-69 (1998) - [j34]Harvey J. Greenberg, Allen G. Holder, Kees Roos, Tamás Terlaky:
On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance. SIAM J. Optim. 9(1): 207-216 (1998) - 1997
- [j33]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: 65-84 (1997) - [j32]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): 251-282 (1997) - [j31]Benjamin Jansen, Kees Roos, Tamás Terlaky, Akiko Yoshise:
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems. Math. Program. 77: 315-345 (1997) - [j30]Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Oper. Res. Lett. 20(5): 213-221 (1997) - [j29]Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen:
Potential reduction algorithms for structured combinatorial optimization problems. Oper. Res. Lett. 21(2): 55-64 (1997) - [j28]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): 126-140 (1997) - 1996
- [j27]Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial:
Primal-dual target-following algorithms for linear programming. Ann. Oper. Res. 62(1): 197-231 (1996) - [j26]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): 11-30 (1996) - [j25]Benjamin Jansen, Cees Roos, Tamás Terlaky:
A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming. Math. Oper. Res. 21(2): 341-353 (1996) - [j24]Benjamin Jansen, Kees Roos, Tamás Terlaky, Yinyu Ye:
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. Math. Program. 76: 117-130 (1996) - 1995
- [j23]Dick den Hertog, John Kaliski, Cees Roos, Tamás Terlaky:
A logarithmic barrier cutting plane method for convex programming. Ann. Oper. Res. 58(2): 67-98 (1995) - [j22]Dick den Hertog, Florian Jarre, Kees Roos, Tamás Terlaky:
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems. Math. Program. 69: 75-88 (1995) - 1993
- [j21]Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky:
A Long-Step Barrier Method for Convex Quadratic Programming. Algorithmica 10(5): 365-382 (1993) - [j20]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. 46-47(1): 107-138 (1993) - 1992
- [j19]Kees Roos, Jean-Philippe Vial:
A polynomial method of approximate centers for linear programming. Math. Program. 54: 295-305 (1992) - [j18]Dick den Hertog, Cees Roos, Tamás Terlaky:
A build-up variant of the logarithmic barrier method for LP. Oper. Res. Lett. 12(3): 181-186 (1992) - [j17]Adrie C. M. Dumay, Mariëlle N. A. J. Claessens, Cees Roos, Jan J. Gerbrands, Johan H. C. Reiber:
Object Delineation in Noisy Images by a Modified Policy-Iteration Method. IEEE Trans. Pattern Anal. Mach. Intell. 14(9): 952-958 (1992) - [j16]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): 55-70 (1992) - [j15]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): 71-87 (1992) - 1991
- [j14]Dick den Hertog, Cees Roos:
A survey of search directions in interior point methods for linear programming. Math. Program. 52: 481-509 (1991) - 1990
- [j13]Cees Roos:
An Exponential Example for Terlaky's Pivoting Rule for the Criss-Cross Simplex Method. Math. Program. 46: 79-84 (1990) - 1989
- [j12]R. M. Damerell, Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, V. Discret. Math. 76(3): 183-189 (1989) - 1986
- [j11]Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, part III. Discret. Math. 58(3): 275-283 (1986) - [j10]Cees Roos, A. J. van Zanten, M. J. Coster:
On the existence of certain generalized moore geometries (Part IV). Discret. Math. 62(2): 139-144 (1986) - 1984
- [j9]Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, part I. Discret. Math. 51(2): 179-190 (1984) - [j8]Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, part II. Discret. Math. 51(3): 277-282 (1984) - 1983
- [j7]Cees Roos:
A note on the existence of perfect constant weight codes. Discret. Math. 47: 121-123 (1983) - [j6]Cornelis Roos:
A new lower bound for the minimum distance of a cyclic code. IEEE Trans. Inf. Theory 29(3): 330-331 (1983) - 1982
- [j5]Cees Roos, Cornelis de Vroedt:
Upper bounds for A(n, 4) and A(n, 6) derived from Delsarte's linear programming bound. Discret. Math. 40(2-3): 261-276 (1982) - [j4]Cees Roos:
A Generalization of the BCH Bound for Cyclic Codes, Including the Hartmann-Tzeng Bound. J. Comb. Theory A 33(2): 229-232 (1982) - [j3]Cornelis Roos, A. J. van Zanten:
On the existence of certain distance-regular graphs. J. Comb. Theory B 33(3): 197-212 (1982) - 1981
- [j2]Cornelis Roos:
On t-constant codes and designs. IEEE Trans. Inf. Theory 27(5): 640-643 (1981) - 1979
- [j1]Cornelis Roos:
On the structure of convolutional and cyclic convolutional codes. IEEE Trans. Inf. Theory 25(6): 676-683 (1979)
Conference and Workshop Papers
- 2008
- [c3]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: 722-729 - 2006
- [c2]Diah Chaerani, Cornelis Roos:
Modelling Some Robust Design Problems via Conic Optimization. OR 2006: 209-214 - 2004
- [c1]Diah Chaerani, Cornelis Roos, A. Aman:
The Robust Shortest Path Problem by Means of Robust Linear Optimization. OR 2004: 335-342
Reference Works
- 2009
- [r4]Kees Roos:
Farkas Lemma. Encyclopedia of Optimization 2009: 995-998 - [r3]Kees Roos:
Linear Optimization: Theorems of the Alternative. Encyclopedia of Optimization 2009: 1878-1881 - [r2]Arkadi Nemirovski, Kees Roos:
Motzkin Transposition Theorem. Encyclopedia of Optimization 2009: 2345-2348 - [r1]Kees Roos:
Tucker Homogeneous Systems of Linear Relations. Encyclopedia of Optimization 2009: 3944-3948
Informal and Other Publications
- 2018
- [i1]Zhize Li, Wei Zhang, Kees Roos:
A Fast Polynomial-time Primal-Dual Projection Algorithm for Linear Programming. CoRR abs/1810.04517 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
