| Publication | Date of Publication | Type |
|---|
| Infeasible interior-point methods for linear optimization based on large neighborhood | 2016-08-31 | Paper |
| A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization | 2013-11-11 | Paper |
| Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones | 2011-11-25 | Paper |
| The non-existence of some perfect codes over non-prime power alphabets | 2011-08-08 | Paper |
| Modelling Some Robust Design Problems via Conic Optimization | 2011-04-07 | Paper |
| Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems | 2011-03-21 | Paper |
| A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions | 2010-05-21 | Paper |
| A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms | 2010-02-26 | Paper |
| Kernel-function Based Algorithms for Semidefinite Optimization | 2009-06-12 | Paper |
| A class of large-update and small-update primal-dual interior-point algorithms for linear optimization | 2009-04-24 | Paper |
| Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions | 2009-04-14 | Paper |
| A polynomial-time algorithm for linear optimization based on a new class of kernel functions | 2009-02-25 | Paper |
| Generic Primal-dual Interior Point Methods Based on a New Kernel Function | 2008-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504911 | 2008-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5453751 | 2008-04-03 | Paper |
| On central-path proximity measures in interior-point methods | 2006-11-06 | Paper |
| A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization | 2006-05-30 | Paper |
| Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function | 2006-01-17 | Paper |
| Extended Matrix Cube Theorems with Applications to μ-Theory in Control | 2005-11-11 | Paper |
| Interior Point Methods for Linear Optimization | 2005-11-03 | Paper |
| Limiting behavior of the central path in semidefinite optimization | 2005-08-25 | Paper |
| A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization | 2005-02-23 | Paper |
| A polynomial-time algorithm for linear optimization based on a new simple kernel function | 2005-02-18 | Paper |
| A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier | 2004-01-19 | Paper |
| On implementing a primal-dual interior-point method for conic quadratic optimization | 2003-10-29 | Paper |
| Notes on Duality in Second Order and p -Order Cone Optimization | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791754 | 2003-02-03 | Paper |
| Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities | 2003-01-05 | Paper |
| Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems | 2003-01-05 | Paper |
| On the Convergence of the Central Path in Semidefinite Optimization | 2003-01-05 | Paper |
| Self-regular functions and new search directions for linear and semidefinite optimization | 2002-12-01 | Paper |
| A new class of polynomial primal-dual methods for linear and semidefinite optimization | 2002-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762524 | 2002-06-16 | Paper |
| A new and efficient large-update interior-point method for linear optimization | 2002-02-24 | Paper |
| A primal‐dual interior-point method for linear optimization based on a new proximity function | 2002-01-01 | Paper |
| A homogenized cutting plane method to solve the convex feasibility problem. | 2001-12-13 | Paper |
| New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction | 2001-12-05 | Paper |
| New complexity analysis of the primal-dual Newton method for linear optimization | 2001-06-14 | Paper |
| Cyclonomial number systems and the ranking of lexicographically ordered constant-sum codes | 2001-05-30 | Paper |
| On copositive programming and standard quadratic optimization problems | 2001-04-17 | Paper |
| A scaled Gauss--Newton primal-dual search direction for semidefinite optimization | 2001-03-19 | Paper |
| A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems | 2001-03-19 | Paper |
| Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming | 2000-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496018 | 2000-10-23 | Paper |
| On maximization of quadratic form over intersection of ellipsoids with common center | 2000-06-26 | Paper |
| Note on a paper of Broyden | 2000-03-19 | Paper |
| Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions | 1999-06-29 | Paper |
| Polynomial primal-dual affine scaling algorithms in semidefinite programming | 1999-05-05 | Paper |
| Logarithmic Barrier Decomposition Methods for Semi-infinite Programming | 1999-05-05 | Paper |
| Sensitivity analysis in linear programming: Just be careful! | 1999-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355913 | 1999-02-18 | Paper |
| A nonconvex weighted potential function for polynomial target following methods | 1998-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840328 | 1998-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400648 | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398364 | 1998-07-19 | Paper |
| Copositive realxation for genera quadratic programming | 1998-06-02 | Paper |
| Improved complexity using higher-order correctors for primal-dual Dikin affine scaling | 1998-04-05 | Paper |
| Initialization in semidefinite programming via a self-dual skew-symmetric embedding | 1998-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362984 | 1997-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347843 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347841 | 1997-08-11 | Paper |
| Method of approximate centers for semi-definite programming | 1997-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343737 | 1997-07-06 | Paper |
| Optimization of nuclear reactor reloading patterns | 1997-06-16 | Paper |
| Achievable potential reductions in the method of Kojima et al. in the case of linear programming | 1997-04-21 | Paper |
| Inverse barrier methods for linear programming | 1997-03-16 | Paper |
| A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems | 1997-03-11 | Paper |
| A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming | 1997-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4892310 | 1997-01-20 | Paper |
| Primal-dual target-following algorithms for linear programming | 1996-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4895331 | 1996-10-14 | Paper |
| A sufficient condition for self-concordance, with application to some classes of structured convex programming problems | 1996-09-18 | Paper |
| A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming | 1996-08-05 | Paper |
| A logarithmic barrier cutting plane method for convex programming | 1996-05-02 | Paper |
| Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840104 | 1995-08-14 | Paper |
| The theory of linear programming:skew symmetric self-dual problems and the central path* | 1995-04-20 | Paper |
| Primal-dual algorithms for linear programming based on the logarithmic barrier method | 1994-12-04 | Paper |
| On the classical logarithmic barrier function method for a class of smooth convex programming problems | 1994-04-27 | Paper |
| Degeneracy in interior point methods for linear programming: A survey | 1994-02-24 | Paper |
| A long-step barrier method for convex quadratic programming | 1993-12-06 | Paper |
| The linear complementarity problem, sufficient matrices, and the criss- cross method | 1993-08-29 | Paper |
| The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method | 1993-05-18 | Paper |
| A polynomial method of approximate centers for linear programming | 1993-01-16 | Paper |
| A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems | 1993-01-16 | Paper |
| A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming | 1993-01-16 | Paper |
| A build-up variant of the logarithmic barrier method for LP | 1993-01-16 | Paper |
| A survey of search directions in interior point methods for linear programming | 1992-06-27 | Paper |
| A Polynomial Method of Weighted Centers for Convex Quadratic Programming | 1992-06-25 | Paper |
| A potential-reduction variant of Renegar's short-step path-following method for linear programming | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3494376 | 1990-01-01 | Paper |
| New trajectory-following polynomial-time algorithm for linear programming problems | 1989-01-01 | Paper |
| On the existence of certain generalized Moore geometries. V | 1989-01-01 | Paper |
| On the existence of certain generalized Moore geometries. III | 1986-01-01 | Paper |
| On the existence of certain generalized Moore geometries. IV | 1986-01-01 | Paper |
| On the existence of certain generalized Moore geometries. I | 1984-01-01 | Paper |
| On the existence of certain generalized Moore geometries. II | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678957 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669454 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4750673 | 1983-01-01 | Paper |
| A new lower bound for the minimum distance of a cyclic code | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739933 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3963021 | 1982-01-01 | Paper |
| On the existence of certain distance-regular graphs | 1982-01-01 | Paper |
| Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3960871 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3932958 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3939719 | 1981-01-01 | Paper |
| An inequality for generalized hexagons | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048847 | 1979-01-01 | Paper |
| On the structure of convolutional and cyclic convolutional codes | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4173295 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133528 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4155016 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4128929 | 1977-01-01 | Paper |
| Ideals of matrixrings over nonassociative rings | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4108481 | 1976-01-01 | Paper |
| The radical property of nonassociative rings such that every homomorphic image has no nonzero left annihilating ideals | 1974-01-01 | Paper |
