The following pages link to Cornelis Roos (Q172146):
Displayed 50 items.
- (Q217002) (redirect page) (← links)
- Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- On the existence of certain generalized Moore geometries. I (Q798661) (← links)
- On the existence of certain generalized Moore geometries. II (Q798662) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- On central-path proximity measures in interior-point methods (Q850820) (← links)
- On the existence of certain generalized Moore geometries. V (Q908929) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
- On the existence of certain generalized Moore geometries. III (Q1076677) (← links)
- On the existence of certain generalized Moore geometries. IV (Q1088670) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- An inequality for generalized hexagons (Q1153552) (← links)
- On the existence of certain distance-regular graphs (Q1165872) (← links)
- Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound (Q1167704) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
- The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
- A nonconvex weighted potential function for polynomial target following methods (Q1265911) (← links)
- Sensitivity analysis in linear programming: Just be careful! (Q1278928) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Optimization of nuclear reactor reloading patterns (Q1357771) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
- Polynomial primal-dual affine scaling algorithms in semidefinite programming (Q1386485) (← links)
- On implementing a primal-dual interior-point method for conic quadratic optimization (Q1411641) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- Self-regular functions and new search directions for linear and semidefinite optimization (Q1849264) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems (Q1922691) (← links)
- On maximization of quadratic form over intersection of ellipsoids with common center (Q1968792) (← links)
- Note on a paper of Broyden (Q1969765) (← links)
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms (Q2266861) (← links)
- The non-existence of some perfect codes over non-prime power alphabets (Q2275366) (← links)
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function (Q2583508) (← links)
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems (Q2706331) (← links)
- A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization (Q2706359) (← links)
- (Q2715949) (← links)
- (Q2735076) (← links)
- (Q2773659) (← links)
- (Q3048847) (← links)