| Publication | Date of Publication | Type |
|---|
| Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming | 2023-06-07 | Paper |
| Conditions for linear convergence of the gradient method for non-convex optimization | 2023-06-05 | Paper |
| Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software | 2022-12-20 | Paper |
| Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere | 2022-10-11 | Paper |
| Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives | 2022-07-18 | Paper |
| An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix | 2022-06-30 | Paper |
| Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere | 2022-06-14 | Paper |
| The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions | 2022-06-10 | Paper |
| Minimum energy configurations on a toric lattice as a quadratic assignment problem | 2022-06-09 | Paper |
| Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization | 2022-05-17 | Paper |
| Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation | 2020-08-18 | Paper |
| A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis | 2020-07-07 | Paper |
| Distributionally robust optimization with polynomial densities: theory, models and algorithms | 2020-06-15 | Paper |
| Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube | 2020-04-30 | Paper |
| Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing | 2020-03-12 | Paper |
| Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy | 2020-02-20 | Paper |
| Polynomial Norms | 2019-02-08 | Paper |
| A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem | 2018-08-13 | Paper |
| On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions | 2017-11-09 | Paper |
| Bound-Constrained Polynomial Optimization Using Only Elementary Calculations | 2017-09-22 | Paper |
| On the convergence rate of grid search for polynomial optimization over the simplex | 2017-04-05 | Paper |
| Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization | 2017-03-23 | Paper |
| Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization | 2017-03-10 | Paper |
| Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization | 2016-10-07 | Paper |
| On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming | 2016-09-23 | Paper |
| Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems | 2016-06-24 | Paper |
| Relaxations of Combinatorial Problems Via Association Schemes | 2016-04-26 | Paper |
| A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives | 2016-01-25 | Paper |
| An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution | 2015-08-18 | Paper |
| An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex | 2015-06-19 | Paper |
| Book drawings of complete bipartite graphs | 2014-03-27 | Paper |
| Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions | 2013-10-25 | Paper |
| Improved Lower Bounds on Book Crossing Numbers of Complete Graphs | 2013-09-26 | Paper |
| On semidefinite programming bounds for graph bandwidth | 2013-06-24 | Paper |
| On semidefinite programming relaxations of maximum \(k\)-section | 2012-12-19 | Paper |
| Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming | 2012-09-12 | Paper |
| Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry | 2012-06-26 | Paper |
| Worst-case CVaR based portfolio optimization models with applications to scenario planning | 2012-05-16 | Paper |
| On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems | 2012-01-09 | Paper |
| On the complexity of computing the handicap of a sufficient matrix | 2011-11-07 | Paper |
| A comparison of lower bounds for the symmetric circulant traveling salesman problem | 2011-10-27 | Paper |
| Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming | 2011-09-27 | Paper |
| Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube | 2011-03-21 | Paper |
| Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem | 2010-06-01 | Paper |
| Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster | 2010-05-21 | Paper |
| Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem | 2010-02-19 | Paper |
| Exploiting special structure in semidefinite programming: a survey of theory and applications | 2009-12-10 | Paper |
| Exploiting group symmetry in truss topology optimization | 2009-12-02 | Paper |
| On Semidefinite Programming Relaxations of the Traveling Salesman Problem | 2009-11-27 | Paper |
| On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs | 2009-06-17 | Paper |
| The complexity of optimizing over a simplex, hypercube or sphere: a short survey | 2008-09-03 | Paper |
| On the complexity of optimization over the standard simplex | 2008-07-10 | Paper |
| A note on the stability number of an orthogonality graph | 2007-08-27 | Paper |
| A linear programming reformulation of the standard quadratic optimization problem | 2007-03-06 | Paper |
| Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation | 2007-03-05 | Paper |
| A PTAS for the minimization of polynomials of fixed degree over the simplex | 2006-09-14 | Paper |
| Improved Bounds for the Crossing Numbers of Km,n and Kn | 2006-06-01 | Paper |
| Global optimization of rational functions: a semidefinite programming approach | 2006-05-02 | Paper |
| Limiting behavior of the central path in semidefinite optimization | 2005-08-25 | Paper |
| On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex | 2005-06-24 | Paper |
| On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function | 2004-11-22 | Paper |
| Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms | 2004-08-16 | Paper |
| On convex quadratic approximation | 2004-06-15 | Paper |
| Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550772 | 2003-06-18 | Paper |
| On semidefinite programming relaxations of \((2+p)\)-SAT | 2003-03-10 | Paper |
| On the Convergence of the Central Path in Semidefinite Optimization | 2003-01-05 | Paper |
| Aspects of semidefinite programming. Interior point algorithms and selected applications | 2002-05-29 | Paper |
| Approximation of the Stability Number of a Graph via Copositive Programming | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749859 | 2001-10-21 | Paper |
| Relaxations of the satisfiability problem using semidefinite programming | 2001-07-26 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4517100 | 2000-11-22 | 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 |
| 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 |
| Copositive realxation for genera quadratic programming | 1998-06-02 | Paper |
| Initialization in semidefinite programming via a self-dual skew-symmetric embedding | 1998-03-02 | 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 |
