| Publication | Date of Publication | Type |
|---|
| Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow | 2023-03-14 | Paper |
| A Slightly Lifted Convex Relaxation for Nonconvex Quadratic Programming with Ball Constraints | 2023-03-02 | Paper |
| A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold | 2022-08-05 | Paper |
| Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs | 2021-10-20 | 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 |
| Strengthened SDP Relaxation for an Extended Trust Region Subproblem with an Application to Optimal Power Flow | 2020-09-26 | Paper |
| Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs | 2020-06-10 | Paper |
| Three methods for robust grading | 2018-10-30 | Paper |
| A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming | 2018-10-10 | Paper |
| Quadratic programs with hollows | 2018-08-22 | Paper |
| A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides | 2018-05-25 | Paper |
| A branch-and-bound algorithm for instrumental variable quantile regression | 2018-02-21 | Paper |
| Robust sensitivity analysis of the optimal value of linear programming | 2017-11-24 | Paper |
| How to convexify the intersection of a second order cone and a nonconvex quadratic | 2017-03-23 | Paper |
| Copositive Programming | 2016-04-26 | Paper |
| A Two-Variable Approach to the Two-Trust-Region Subproblem | 2016-03-30 | Paper |
| A gentle, geometric introduction to copositive optimization | 2015-06-19 | Paper |
| The trust region subproblem with non-intersecting linear constraints | 2015-02-09 | Paper |
| A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs | 2014-09-26 | Paper |
| Faster, but weaker, relaxations for quadratically constrained quadratic programs | 2014-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2875385 | 2014-08-14 | Paper |
| Unbounded convex sets for non-convex mixed-integer quadratic programming | 2014-02-25 | Paper |
| Second-Order-Cone Constraints for Extended Trust-Region Subproblems | 2013-06-27 | Paper |
| Separation and relaxation for cones of quadratic forms | 2013-03-18 | Paper |
| Newsvendor games: convex optimization of centralized inventory operations | 2013-02-26 | Paper |
| Globally solving nonconvex quadratic programming problems via completely positive programming | 2012-11-27 | Paper |
| Representing quadratically constrained quadratic programs as generalized copositive programs | 2012-08-17 | Paper |
| The MILP Road to MIQCP | 2012-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093393 | 2011-10-12 | Paper |
| Relaxing the optimality conditions of box QP | 2011-05-25 | Paper |
| A semidefinite programming approach to the hypergraph minimum bisection problem | 2011-05-03 | Paper |
| Computable representations for convex hulls of low-dimensional quadratic forms | 2010-09-16 | Paper |
| Optimizing a polyhedral-semidefinite relaxation of completely positive programs | 2010-06-21 | Paper |
| On Nonconvex Quadratic Programming with Box Constraints | 2010-06-01 | Paper |
| Ap-cone sequential relaxation procedure for 0-1 integer programs | 2009-09-18 | Paper |
| The difference between \(5\times 5\) doubly nonnegative and completely positive matrices | 2009-09-14 | Paper |
| Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound | 2009-09-02 | Paper |
| On the copositive representation of binary and continuous nonconvex quadratic programs | 2009-07-24 | Paper |
| On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization | 2008-12-05 | Paper |
| A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations | 2008-03-12 | Paper |
| Coordinating the supply chain in the agricultural seed industry | 2007-10-18 | Paper |
| Solving maximum-entropy sampling problems using factored masks | 2007-03-05 | Paper |
| Computational enhancements in low-rank semidefinite programming | 2006-06-16 | Paper |
| Solving Lift-and-Project Relaxations of Binary Integer Programs | 2006-05-30 | Paper |
| D.C. versus copositive bounds for standard QP | 2006-01-13 | Paper |
| Local minima and convergence in low-rank semidefinite programming | 2005-08-08 | Paper |
| A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming | 2004-08-16 | Paper |
| Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices | 2004-01-19 | Paper |
| A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization | 2003-10-29 | Paper |
| A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs | 2003-10-29 | Paper |
| Maximum stable set formulations and heuristics based on continuous optimization | 2003-07-13 | Paper |
| Solving a class of semidefinite programs via nonlinear programming | 2002-12-01 | Paper |
| Interior-point algorithms for semidefinite programming based on a nonlinear formulation | 2002-08-19 | Paper |
| Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs | 2002-04-23 | Paper |
| A projected gradient algorithm for solving the maxcut SDP relaxation | 2001-01-01 | Paper |
