| Publication | Date of Publication | Type |
|---|
| A semismooth Newton-type method for the nearest doubly stochastic matrix problem | 2024-06-27 | Paper |
| Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method | 2023-11-08 | Paper |
| Preconditioning for Generalized Jacobians with the $\omega$-Condition Number | 2023-08-25 | Paper |
| Revisiting degeneracy, strict feasibility, stability, in linear programming | 2023-07-11 | Paper |
| Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs | 2023-05-25 | Paper |
| Regularized Nonsmooth Newton Algorithms for Best Approximation | 2022-12-26 | Paper |
| Singularity degree of non-facially exposed faces | 2022-11-01 | Paper |
| A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP | 2022-09-19 | Paper |
| Combining semidefinite and polyhedral relaxations for integer programs | 2022-08-30 | Paper |
| A strengthened Barvinok-Pataki bound on SDP rank | 2022-03-11 | Paper |
| A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem | 2021-07-20 | Paper |
| A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem | 2021-06-01 | Paper |
| Error Bounds and Singularity Degree in Semidefinite Programming | 2021-03-31 | Paper |
| Robust principal component analysis using facial reduction | 2021-01-18 | Paper |
| A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem | 2020-09-03 | Paper |
| A Restricted Dual Peaceman-Rachford Splitting Method for QAP | 2020-06-02 | Paper |
| Facial Reduction for Symmetry Reduced Semidefinite Doubly Nonnegative Programs | 2019-12-21 | Paper |
| Noisy Euclidean distance matrix completion with a single missing node | 2019-12-03 | Paper |
| Maximum determinant positive definite Toeplitz completions | 2019-11-27 | Paper |
| Parametric convex quadratic relaxation of the quadratic knapsack problem | 2019-10-17 | Paper |
| ADMM for the SDP relaxation of the QAP | 2019-05-03 | Paper |
| Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration | 2019-03-29 | Paper |
| Low-rank matrix completion using nuclear norm minimization and facial reduction | 2018-12-21 | Paper |
| Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier | 2017-11-03 | Paper |
| Complete Facial Reduction in One Step for Spectrahedra | 2017-10-20 | Paper |
| The many faces of degeneracy in conic optimization | 2017-06-12 | Paper |
| A note on alternating projections for ill-posed semidefinite feasibility problems | 2017-03-23 | Paper |
| Local nonglobal minima for solving large-scale extended trust-region subproblems | 2017-03-07 | Paper |
| Rank Restricted Semidefinite Matrices and Image Closedness | 2016-10-31 | Paper |
| Hiroshima’s theorem and matrix norm inequalities | 2016-09-09 | Paper |
| Computing the generators of the truncated real radical ideal by moment matrices and SDP facial reduction | 2016-06-01 | Paper |
| Euclidean Distance Matrices and Applications | 2016-04-26 | Paper |
| Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem | 2016-02-23 | Paper |
| Projection methods for quantum channel construction | 2015-09-23 | Paper |
| Extreme point inequalities and geometry of the rank sparsity ball | 2015-08-31 | Paper |
| Coordinate Shadows of Semidefinite and Euclidean Distance Matrices | 2015-06-24 | Paper |
| Efficient use of semidefinite programming for selection of rotamers in protein conformations | 2015-01-26 | Paper |
| The generalized trust region subproblem | 2014-09-26 | Paper |
| Projection methods in quantum information science | 2014-07-24 | Paper |
| Preprocessing and regularization for degenerate semidefinite programs | 2014-02-18 | Paper |
| Sensor network localization, Euclidean distance matrix completions, and graph realization | 2013-10-24 | Paper |
| Preface | 2013-07-12 | Paper |
| Strong duality and minimal representations for cone optimization | 2013-01-04 | Paper |
| An eigenvalue majorization inequality for positive semidefinite block matrices | 2012-11-29 | Paper |
| A robust algorithm for semidefinite programming | 2012-11-06 | Paper |
| Euclidean distance matrices, semidefinite programming and sensor network localization | 2011-04-27 | Paper |
| On equivalence of semidefinite relaxations for quadratic matrix programming | 2011-04-27 | Paper |
| A low-dimensional semidefinite relaxation for the quadratic assignment problem | 2011-04-27 | Paper |
| Explicit sensor network localization using semidefinite representations and facial reductions | 2011-03-21 | Paper |
| Generating and measuring instances of hard semidefinite programs | 2010-10-13 | Paper |
| Generating eigenvalue bounds using optimization | 2010-03-05 | Paper |
| A stable primal-dual approach for linear programming under nondegeneracy assumptions | 2010-02-24 | Paper |
| Explicit sensor network localization using semidefinite representations and facial reductions | 2010-01-01 | Paper |
| Large scale portfolio optimization with piecewise linear transaction costs | 2009-02-23 | Paper |
| Regularization using a parameterized trust region subproblem | 2008-12-16 | Paper |
| Some necessary and some sufficient trace inequalities for Euclidean distance matrices | 2007-10-19 | Paper |
| Convergence of a short-step primal-dual algorithm based on the Gauss-Newton direction | 2005-10-31 | Paper |
| Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming | 2005-09-28 | Paper |
| Solving semidefinite programs using preconditioned conjugate gradients | 2005-07-18 | Paper |
| Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming | 2005-06-01 | Paper |
| The trust region subproblem and semidefinite programming* | 2005-04-29 | Paper |
| Two theorems on Euclidean distance matrices and Gale transform | 2003-01-28 | Paper |
| Semidefinite and Lagrangian relaxations for hard combinatorial problems | 2002-11-30 | Paper |
| A note on lack of strong duality for quadratic problems with orthogonal constraints | 2002-11-20 | Paper |
| Semidefinite programming for discrete optimization and matrix completion problems | 2002-09-17 | Paper |
| The Gauss-Newton direction in semidefinite programming | 2002-09-12 | Paper |
| Geometry of semidefinite Max-Cut relaxations via matrix ranks | 2002-08-20 | Paper |
| Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem | 2002-06-24 | Paper |
| On Lagrangian relaxation of quadratic matrix constraints | 2001-03-19 | Paper |
| Strengthened semidefinite programming relaxations for the max-cut problem. | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517108 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517113 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517115 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517096 | 2000-11-22 | Paper |
| Strong duality for a trust-region type relaxation of the quadratic assignment problem | 2000-06-19 | Paper |
| Semidefinite programming relaxations for the graph partitioning problem | 2000-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801579 | 2000-01-01 | Paper |
| Pseudolinear Programming | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840112 | 1999-04-08 | Paper |
| Solving Euclidean distance matrix completion problems via semidefinite progrmming | 1999-01-01 | Paper |
| Semidefinite programming relaxations for the quadratic assignment problem | 1998-08-10 | Paper |
| An interior-point method for approximate positive semidefinite completions | 1998-07-29 | Paper |
| Strong Duality for Semidefinite Programming | 1998-02-10 | Paper |
| Foreword to: Semidefinite programming | 1997-12-04 | Paper |
| A semidefinite framework for trust region subproblems with applications to large scale minimization | 1997-11-25 | Paper |
| An Interior-Point Method for Semidefinite Programming | 1996-09-22 | Paper |
| Convex Relaxations of (0, 1)-Quadratic Programming | 1996-09-16 | Paper |
| Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations | 1996-09-12 | Paper |
| A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming | 1996-08-19 | Paper |
| Explicit solutions for interval semidefinite linear programs | 1996-04-28 | Paper |
| A projection technique for partitioning the nodes of a graph | 1996-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321546 | 1995-08-01 | Paper |
| Measures for Symmetric Rank-One Updates | 1995-05-14 | Paper |
| An All-Inclusive Efficient Region of Updates for Least Change Secant Methods | 1995-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321556 | 1995-02-16 | Paper |
| Sizing and Least-Change Secant Methods | 1994-12-11 | Paper |
| A computational study of graph partitioning | 1994-12-11 | Paper |
| Trust Region Problems and Nonsymmetric Eigenvalue Perturbations | 1994-09-13 | Paper |
| A New Lower Bound Via Projection for the Quadratic Assignment Problem | 1993-01-17 | Paper |
| Generalizations of Slater's constraint qualification for infinite convex programs | 1993-01-16 | Paper |
| Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality | 1992-07-22 | Paper |
| Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem | 1992-06-28 | Paper |
| Exponential Nonnegativity on the Ice Cream Cone | 1991-01-01 | Paper |
| Invariant ellipsoidal cones | 1991-01-01 | Paper |
| A note on generalized invariant cones and the Kronecker canonical form | 1991-01-01 | Paper |
| Zero duality gaps in infinite-dimensional programming | 1990-01-01 | Paper |
| Post-Processing Piecewise Cubics for Monotonicity | 1989-01-01 | Paper |
| An explicit linear solution for the quadratic dynamic programming problem | 1988-01-01 | Paper |
| Normal matrices | 1987-01-01 | Paper |
| A note on maximizing the permanent of a positive definite hermitian matrix, given the eigenvalues∗ | 1986-01-01 | Paper |
| A simple constraint qualification in infinite dimensional programming | 1986-01-01 | Paper |
| A nonlinear equation for linear programming | 1986-01-01 | Paper |
| Nonnegative Solutions of a Quadratic Matrix Equation Arising from Comparison Theorems in Ordinary Differential Equations | 1985-01-01 | Paper |
| Improving eigenvalue bounds using extra bounds | 1985-01-01 | Paper |
| Positive definite completions of partial Hermitian matrices | 1984-01-01 | Paper |
| Dimensionality of biinfinite systems | 1984-01-01 | Paper |
| Improving Hadamard's inequality* | 1984-01-01 | Paper |
| An optimality condition for a nondifferentiable convex program | 1983-01-01 | Paper |
| Bounds for ratios of eigenvalues using traces | 1983-01-01 | Paper |
| Method of reduction in convex programming | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4744078 | 1983-01-01 | Paper |
| Characterizations of optimality without constraint qualification for the abstract convex program | 1982-01-01 | Paper |
| Regularizing the abstract convex program | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916398 | 1981-01-01 | Paper |
| Some applications of optimization in matrix theory | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3320135 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3923971 | 1981-01-01 | Paper |
| A strengthened test for optimality | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3863701 | 1980-01-01 | Paper |
| Bounds for eigenvalues using traces | 1980-01-01 | Paper |
| Geometry of optimality conditions and constraint qualifications: The convex case | 1980-01-01 | Paper |
| More bounds for eigenvalues using traces | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3908774 | 1980-01-01 | Paper |
| Calculating the Best Approximate Solution of an Operator Equation | 1978-01-01 | Paper |
| Calculating the cone of directions of constancy | 1978-01-01 | Paper |
