The following pages link to Cornelis Roos (Q172146):
Displayed 50 items.
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems (Q3083319) (← links)
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems (Q3124039) (← links)
- (Q3494376) (← links)
- (Q3504911) (← links)
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
- A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions (Q3562408) (← links)
- Kernel-function Based Algorithms for Semidefinite Optimization (Q3632808) (← links)
- (Q3669454) (← links)
- A new lower bound for the minimum distance of a cyclic code (Q3671045) (← links)
- (Q3678957) (← links)
- (Q3840328) (← links)
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)
- On the structure of convolutional and cyclic convolutional codes (Q3877555) (← links)
- (Q3932958) (← links)
- (Q3939719) (← links)
- (Q3960871) (← links)
- (Q3963021) (← links)
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933) (← links)
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems (Q4018385) (← links)
- A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming (Q4018386) (← links)
- The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method (Q4035647) (← links)
- The radical property of nonassociative rings such that every homomorphic image has no nonzero left annihilating ideals (Q4047694) (← links)
- (Q4108481) (← links)
- Ideals of matrixrings over nonassociative rings (Q4108483) (← links)
- (Q4128929) (← links)
- (Q4133528) (← links)
- (Q4155016) (← links)
- (Q4173295) (← links)
- (Q4343737) (← links)
- Method of approximate centers for semi-definite programming (Q4345241) (← links)
- (Q4347841) (← links)
- (Q4347843) (← links)
- (Q4355913) (← links)
- (Q4362984) (← links)
- Copositive realxation for genera quadratic programming (Q4391294) (← links)
- (Q4398364) (← links)
- (Q4400648) (← links)
- A primal‐dual interior-point method for linear optimization based on a new proximity function (Q4405935) (← links)
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier (Q4441922) (← links)
- (Q4496018) (← links)
- A polynomial-time algorithm for linear optimization based on a new simple kernel function (Q4650623) (← links)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization (Q4651997) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- (Q4739933) (← links)
- (Q4750673) (← links)
- (Q4762524) (← links)
- The theory of linear programming:skew symmetric self-dual problems and the central path<sup>*</sup> (Q4764897) (← links)
- On the Convergence of the Central Path in Semidefinite Optimization (Q4785863) (← links)
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities (Q4785875) (← links)
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems (Q4785894) (← links)