Kees Roos

According to our database1, Kees Roos authored at least 85 papers between 1979 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
An improved version of Chubanov's method for solving a homogeneous feasibility problem.
Optim. Methods Softw., 2018

A Fast Polynomial-time Primal-Dual Projection Algorithm for Linear Programming.
CoRR, 2018

2017
Optimal Strategies for Flood Prevention.
Manag. Sci., 2017

2016
Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood.
J. Optim. Theory Appl., 2016

2014
Economically Efficient Standards to Protect the Netherlands Against Flooding.
Interfaces, 2014

2013
A Full Nesterov-Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization.
J. Optim. Theory Appl., 2013

2012
Safe Dike Heights at Minimal Costs: The Nonhomogeneous Case.
Oper. Res., 2012

2011
Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones.
J. Optim. Theory Appl., 2011

Full Nesterov-Todd step infeasible interior-point method for symmetric optimization.
Eur. J. Oper. Res., 2011

The non-existence of some perfect codes over non-prime power alphabets.
Discret. Math., 2011

2010
Unified Analysis of Kernel-Based Interior-Point Methods for P<sub>*(Kappa)</sub>-Linear Complementarity Problems.
SIAM J. Optim., 2010

Counterexample to a Conjecture on an Infeasible Interior-Point Method.
SIAM J. Optim., 2010

Convergence of the homotopy path for a full-Newton step infeasible interior-point method.
Oper. Res. Lett., 2010

A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions.
Optim. Methods Softw., 2010

2009
Tucker Homogeneous Systems of Linear Relations.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Linear Optimization: Theorems of the Alternative.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Farkas Lemma.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Motzkin Transposition Theorem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Kernel-function Based Algorithms for Semidefinite Optimization.
RAIRO Oper. Res., 2009

A new full-Newton step <i>O</i>(<i>n</i>) infeasible interior-point algorithm for semidefinite optimization.
Numer. Algorithms, 2009

2008
Generic Primal-dual Interior Point Methods Based on a New Kernel Function.
RAIRO Oper. Res., 2008

Primal-dual algorithm for linear optimization problems based on a new class of kernel functions.
Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC 2008), 2008

2006
A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization.
SIAM J. Optim., 2006

Modelling Some Robust Design Problems via Conic Optimization.
Proceedings of the Operations Research, 2006

2005
Limiting behavior of the central path in semidefinite optimization.
Optim. Methods Softw., 2005

Primal-Dual Interior-Point Algorithms for Semidefinite Optimization Based on a Simple Kernel Function.
J. Math. Model. Algorithms, 2005

2004
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization.
SIAM J. Optim., 2004

The Robust Shortest Path Problem by Means of Robust Linear Optimization.
Proceedings of the Operations Research, 2004

2003
Foreword.
Optim. Methods Softw., 2003

A polynomial-time algorithm for linear optimization based on a new simple kernel function.
Optim. Methods Softw., 2003

On implementing a primal-dual interior-point method for conic quadratic optimization.
Math. Program., 2003

Extended Matrix Cube Theorems with Applications to µ-Theory in Control.
Math. Oper. Res., 2003

2002
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities.
SIAM J. Optim., 2002

On the Convergence of the Central Path in Semidefinite Optimization.
SIAM J. Optim., 2002

Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems.
SIAM J. Optim., 2002

A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier.
SIAM J. Optim., 2002

A primal-dual interior-point method for linear optimization based on a new proximity function.
Optim. Methods Softw., 2002

Self-regular functions and new search directions for linear and semidefinite optimization.
Math. Program., 2002

A new class of polynomial primal-dual methods for linear and semidefinite optimization.
Eur. J. Oper. Res., 2002

Self-regularity - a new paradigm for primal-dual interior-point algorithms.
Princeton series in applied mathematics, Princeton University Press, ISBN: 978-0-691-09193-8, 2002

2001
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization.
SIAM J. Optim., 2001

2000
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P<sub>*(kappa)</sub> Linear Complementarity Problems.
SIAM J. Optim., 2000

On Copositive Programming and Standard Quadratic Optimization Problems.
J. Glob. Optim., 2000

New Complexity Analysis of the Primal - Dual Newton Method for Linear Optimization.
Ann. Oper. Res., 2000

1999
Note on a paper of Broyden.
Oper. Res. Lett., 1999

On maximization of quadratic form over intersection of ellipsoids with common center.
Math. Program., 1999

Basis- and partition identification for quadratic programming and linear complementarity problems.
Math. Program., 1999

1998
On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance.
SIAM J. Optim., 1998

Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming.
J. Comb. Optim., 1998

Cyclonomial Number Systems and the Ranking of Lexicographically Ordered Constant-Sum Codes.
Ars Comb., 1998

A nonconvex weighted potential function forpolynomial target following methods.
Ann. Oper. Res., 1998

Theory and algorithms for linear optimization - an interior point approach.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-95676-1, 1998

1997
A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems.
SIAM J. Optim., 1997

Potential reduction algorithms for structured combinatorial optimization problems.
Oper. Res. Lett., 1997

Initialization in semidefinite programming via a self-dual skew-symmetric embedding.
Oper. Res. Lett., 1997

Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems.
Math. Program., 1997

A Potential Reduction Approach to the Frequency Assignment Problem.
Discret. Appl. Math., 1997

Optimization of nuclear reactor reloading patterns.
Ann. Oper. Res., 1997

1996
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
Math. Program., 1996

A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming.
Math. Oper. Res., 1996

Long-step primal-dual target-following algorithms for linear programming.
Math. Methods Oper. Res., 1996

Primal-dual target-following algorithms for linear programming.
Ann. Oper. Res., 1996

1995
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems.
Math. Program., 1995

A logarithmic barrier cutting plane method for convex programming.
Ann. Oper. Res., 1995

1993
Degeneracy in interior point methods for linear programming: a survey.
Ann. Oper. Res., 1993

A Long-Step Barrier Method for Convex Quadratic Programming.
Algorithmica, 1993

1992
A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming.
SIAM J. Optim., 1992

A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems.
SIAM J. Optim., 1992

Object Delineation in Noisy Images by a Modified Policy-Iteration Method.
IEEE Trans. Pattern Anal. Mach. Intell., 1992

A build-up variant of the logarithmic barrier method for LP.
Oper. Res. Lett., 1992

A polynomial method of approximate centers for linear programming.
Math. Program., 1992

1991
A survey of search directions in interior point methods for linear programming.
Math. Program., 1991

1990
An Exponential Example for Terlaky's Pivoting Rule for the Criss-Cross Simplex Method.
Math. Program., 1990

1989
On the existence of certain generalized Moore geometries, V.
Discret. Math., 1989

1986
On the existence of certain generalized moore geometries (Part IV).
Discret. Math., 1986

On the existence of certain generalized Moore geometries, part III.
Discret. Math., 1986

1984
On the existence of certain generalized Moore geometries, part II.
Discret. Math., 1984

On the existence of certain generalized Moore geometries, part I.
Discret. Math., 1984

1983
A new lower bound for the minimum distance of a cyclic code.
IEEE Trans. Inf. Theory, 1983

A note on the existence of perfect constant weight codes.
Discret. Math., 1983

1982
On the existence of certain distance-regular graphs.
J. Comb. Theory, Ser. B, 1982

A Generalization of the BCH Bound for Cyclic Codes, Including the Hartmann-Tzeng Bound.
J. Comb. Theory, Ser. A, 1982

Upper bounds for A(n, 4) and A(n, 6) derived from Delsarte's linear programming bound.
Discret. Math., 1982

1981
On t-constant codes and designs.
IEEE Trans. Inf. Theory, 1981

1979
On the structure of convolutional and cyclic convolutional codes.
IEEE Trans. Inf. Theory, 1979


  Loading...