| Publication | Date of Publication | Type |
|---|
| Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching | 2024-09-02 | Paper |
| Convex hull representations for bounded products of variables | 2021-08-17 | Paper |
| Quadratic optimization with switching variables: the convex hull for \(n=2\) | 2021-08-11 | Paper |
| Testing copositivity via mixed-integer linear programming | 2021-02-12 | Paper |
| Efficient Solution of Maximum-Entropy Sampling Problems | 2021-01-19 | Paper |
| Continuous relaxations for Constrained Maximum-Entropy Sampling | 2019-01-11 | Paper |
| Maximum-entropy sampling and the Boolean quadric polytope | 2018-12-27 | Paper |
| Quadratic programs with hollows | 2018-08-22 | Paper |
| Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem | 2017-03-10 | Paper |
| An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes | 2013-09-13 | Paper |
| Second-Order-Cone Constraints for Extended Trust-Region Subproblems | 2013-06-27 | Paper |
| Separating doubly nonnegative and completely positive matrices | 2013-03-18 | Paper |
| Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\) | 2013-03-12 | Paper |
| On convex relaxations for quadratically constrained quadratic programming | 2012-12-19 | Paper |
| Interior-point algorithms for a generalization of linear programming and weighted centring | 2012-11-06 | Paper |
| Computable representations for convex hulls of low-dimensional quadratic forms | 2010-09-16 | Paper |
| A note on ``\(5\times 5\) completely positive matrices | 2010-07-20 | Paper |
| The difference between \(5\times 5\) doubly nonnegative and completely positive matrices | 2009-09-14 | Paper |
| Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming | 2009-07-13 | Paper |
| Two ``well-known properties of subgradient optimization | 2009-05-05 | Paper |
| An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space | 2008-10-29 | Paper |
| D.C. versus copositive bounds for standard QP | 2006-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465122 | 2005-08-22 | Paper |
| The thirteen spheres: a new proof | 2004-12-13 | Paper |
| The volumetric barrier for convex quadratic constraints | 2004-10-28 | Paper |
| Recent advances in the solution of quadratic assignment problems | 2003-09-01 | Paper |
| Improved Complexity for Maximum Volume Inscribed Ellipsoids | 2003-01-05 | Paper |
| Solving large quadratic assignment problems on computational grids | 2002-12-01 | Paper |
| Improved linear programming bounds for antipodal spherical codes. | 2002-08-20 | Paper |
| A new bound for the quadratic assignment problem based on convex quadratic programming | 2002-06-05 | Paper |
| Solving quadratic assignment problems using convex quadratic programming relaxations | 2002-02-26 | Paper |
| Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming | 2001-11-26 | Paper |
| Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier | 2001-11-26 | Paper |
| The Volumetric Barrier for Semidefinite Programming | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743961 | 2001-09-18 | Paper |
| Maximum-entropy remote sampling | 2001-06-19 | Paper |
| On Lagrangian Relaxation of Quadratic Matrix Constraints | 2001-03-19 | Paper |
| A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite | 2001-03-19 | Paper |
| Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem | 2001-03-19 | Paper |
| Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems | 2001-02-09 | Paper |
| Strong duality for a trust-region type relaxation of the quadratic assignment problem | 2000-06-19 | Paper |
| Linear Programming in O([n3/ln nL) Operations] | 1999-11-24 | Paper |
| Towards a Practical Volumetric Cutting Plane Method for Convex Programming | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400646 | 1998-08-02 | Paper |
| Volumetric path following algorithms for linear programming | 1998-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347844 | 1997-08-11 | Paper |
| On Vaidya's Volumetric Cutting Plane Method for Convex Programming | 1997-06-09 | Paper |
| Large step volumetric potential reduction algorithms for linear programming | 1996-07-01 | Paper |
| On Long Step Path Following and SUMT for Linear and Quadratic Programming | 1996-05-13 | Paper |
| A New Infinity-Norm Path Following Algorithm for Linear Programming | 1995-08-07 | Paper |
| A Monotonic Build-Up Simplex Algorithm for Linear Programming | 1994-09-15 | Paper |
| Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming | 1994-04-12 | Paper |
| On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP | 1994-04-12 | Paper |
| A Family of Search Directions for Karmarkar's Algorithm | 1994-01-02 | Paper |
| A long-step barrier method for convex quadratic programming | 1993-12-06 | Paper |
| On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise | 1993-04-01 | Paper |
| Long steps in an \(O(n^ 3L)\) algorithm for linear programming | 1993-01-16 | Paper |
| Crashing a maximum-weight complementary basis | 1993-01-16 | Paper |
| On interior algorithms for linear programming with no regularity assumptions | 1993-01-16 | Paper |
| On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations | 1993-01-16 | Paper |
| A combined phase I-phase II scaled potential algorithm for linear programming | 1992-06-27 | Paper |
| On monotonicity in the scaled potential algorithm for linear programming | 1991-01-01 | Paper |
| A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3351138 | 1990-01-01 | Paper |
| A combined phase I-phase II projective algorithm for linear programming | 1989-01-01 | Paper |
| The Worst-Case Step in Karmarkar's Algorithm | 1989-01-01 | Paper |
| Linear programming and the Newton barrier flow | 1988-01-01 | Paper |
| Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse | 1987-01-01 | Paper |
| A monotonic projective algorithm for fractional linear programming | 1986-01-01 | Paper |
| A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm | 1986-01-01 | Paper |
