Roos, Cornelis, 1941-....
Roos, C.
Roos, C. (Cornelis), 1941-
Cornelis Roos
VIAF ID: 117302942 ( Personal )
Permalink: http://viaf.org/viaf/117302942
Preferred Forms
- 100 0 _ ‡a Cornelis Roos
-
- 100 1 _ ‡a Roos, C.
-
-
- 100 1 _ ‡a Roos, Cornelis ‡d 1941-
- 100 1 _ ‡a Roos, Cornelis ‡d 1941-...
-
-
-
-
- 100 1 0 ‡a Roos, Cornelis, ‡d 1941-
- 100 1 _ ‡a Roos, Cornelis, ‡d 1941-....
4xx's: Alternate Name Forms (14)
Works
Title | Sources |
---|---|
The 5th World microcomputer chess championship, september 7-15, 1985 : World Trade Centre Amsterdam | |
Achievable potential reductions in the method of Kojima et al. in the case of linear programming | |
Advances in linear optimization : (annotated bibliography) | |
A build-up variant of the path-following method for LP | |
Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case | |
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method | |
An extension of the MS pivoting rule to capacitated network flow problems | |
The influence of the potential function on the performance of a trajectory following algorithm for the linear programming problem | |
Initialization in semidefinite programming via a self-dual skew-symmetric embedding | |
Iri's polynomiality proof for the IRI-IMAI method recast | |
The linear complementarity problem, sufficient matrices and the criss-cross method | |
Modelleren en optimaliseren met wiskunde : beoefening van wiskunde in het spoor van Newton | |
A new algorithm for the computation of the smallest eigenvalue of a symmetric matrix and its eigenspace | |
New complexity analysis of primal-dual method for semidefinite optimization based on the NT-direction | |
A nonconvex weighted potential function for polynomial target following methods | |
On Karmarkar's projective method for linear programming | |
On maximization of quadratic form over intersection of ellipsoids with common center | |
On the classical logarithmic barrier function method for a class of smooth convex programming problems | |
On the volume of an n-dimensional simplex | |
The optimal set and optimal partition approach to linear and quadratic programming | |
A polynomial method of weighted centers for convex quadratic programming | |
Polynomial primal-dual affine scaling algorithms in semidefinite programming | |
Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques (HPOPT '96) September 19-20, 1996, Delft, Netherlands | |
Regularities of rings [MI] 1975 | |
Self-regularity : a new paradigm for primal-dual interior-point algorithms | |
Semi-definite problems in truss topology optimization | |
A short survey on ten years interior point methods | |
Solving linear systems with low-rank updates | |
Standaardisatie olfactometers | |
Theory and algorithms for linear optimization | |
The theory of linear programming: skew symmetric self-dual problems and the central path | |
De tijd zal het leren | |
A weighting system for lexicographically ordered constant-sum codes over an arbitrary alphabet |