| Publication | Date of Publication | Type |
|---|
| Total dual dyadicness and dyadic generating sets | 2024-08-20 | Paper |
| Graphs with large girth and chromatic number are hard for Nullstellensatz | 2024-07-16 | Paper |
| Linear optimization over homogeneous matrix cones | 2023-09-12 | Paper |
| Dyadic linear programming and extensions | 2023-09-08 | Paper |
| Testing idealness in the filter oracle model | 2022-12-12 | Paper |
| Graphs with large girth and chromatic number are hard for Nullstellensatz | 2022-12-10 | Paper |
| Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices | 2022-09-12 | Paper |
| Total dual dyadicness and dyadic generating sets | 2022-08-16 | Paper |
| Status determination by interior-point methods for convex optimization problems in domain-driven form | 2022-06-29 | Paper |
| Clean Clutters and Dyadic Fractional Packings | 2022-04-20 | Paper |
| Testing idealness in the filter oracle model | 2022-02-15 | Paper |
| On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices | 2021-02-12 | Paper |
| Primal-Dual Interior-Point Methods for Domain-Driven Formulations | 2020-09-01 | Paper |
| Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture | 2020-08-04 | Paper |
| A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations | 2020-02-20 | Paper |
| Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP | 2019-11-08 | Paper |
| Facially Dual Complete (Nice) Cones and Lexicographic Tangents | 2019-09-26 | Paper |
| Domain-Driven Solver (DDS) Version 2.0: a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form | 2019-08-07 | Paper |
| Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators | 2018-08-17 | Paper |
| Strict Complementarity in MaxCut SDP | 2018-06-04 | Paper |
| A utility theory based interactive approach to robustness in linear optimization | 2018-05-25 | Paper |
| Pointed Closed Convex Sets are the Intersection of All Rational Supporting Closed Halfspaces | 2018-02-08 | Paper |
| Primal-dual entropy-based interior-point algorithms for linear optimization | 2017-06-15 | Paper |
| An axiomatic duality framework for the theta body and related convex corners | 2017-03-23 | Paper |
| Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives | 2017-01-13 | Paper |
| Efficient heuristic algorithms for maximum utility product pricing problems | 2016-11-17 | Paper |
| Perturbed sums-of-squares theorem for polynomial optimization and its applications | 2016-06-10 | Paper |
| A search for quantum coin-flipping protocols using optimization techniques | 2016-04-04 | Paper |
| A Comprehensive Analysis of Polyhedral Lift-and-Project Methods | 2016-03-04 | Paper |
| On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs | 2015-04-16 | Paper |
| Interior-point algorithms for convex optimization based on primal-dual metrics | 2014-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191865 | 2014-09-25 | Paper |
| \(s\)-goodness for low-rank matrix recovery | 2013-09-19 | Paper |
| Some advances on Lovász-Schrijver relaxations of the fractional stable set polytope | 2013-07-23 | Paper |
| Near-perfect graphs with polyhedral | 2013-07-23 | Paper |
| Optimization problems over unit-distance representations of graphs | 2013-06-07 | Paper |
| Strong duality and minimal representations for cone optimization | 2013-01-04 | Paper |
| Existence and uniqueness of solutions for homogeneous cone complementarity problems | 2012-06-26 | Paper |
| Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems | 2012-06-26 | Paper |
| Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes | 2011-06-24 | Paper |
| Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming | 2011-05-11 | Paper |
| Maximum utility product pricing models and algorithms based on reservation price | 2011-05-11 | Paper |
| Polyhedral and semidefinite programming methods in combinatorial optimization | 2010-12-14 | Paper |
| Self-concordant barriers for convex approximations of structured convex sets | 2010-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3568358 | 2010-06-11 | Paper |
| Clarke generalized Jacobian of the projection onto symmetric cones | 2009-08-11 | Paper |
| VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS | 2009-06-30 | Paper |
| Lehman matrices | 2009-06-23 | Paper |
| On the polyhedral lift-and-project methods and the fractional stable set polytope | 2009-05-07 | Paper |
| Homogeneous Cone Complementarity Problems and $P$ Properties | 2009-04-11 | Paper |
| Large scale portfolio optimization with piecewise linear transaction costs | 2009-02-23 | Paper |
| Invariance and efficiency of convex representations | 2008-01-21 | Paper |
| Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra | 2007-11-30 | Paper |
| Clustering via minimum volume ellipsoids | 2007-10-12 | Paper |
| On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping | 2005-11-11 | Paper |
| When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? | 2005-11-11 | Paper |
| Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming | 2005-06-01 | Paper |
| ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods | 2005-04-19 | Paper |
| Lift-and-project ranks and antiblocker duality | 2004-11-19 | Paper |
| Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers | 2004-10-05 | Paper |
| The stable set problem and the lift-and-project ranks of graphs | 2004-03-11 | Paper |
| Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard | 2004-02-10 | Paper |
| Some fundamental properties of successive convex relaxation methods on LCP and related problems | 2003-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789195 | 2003-04-23 | Paper |
| On the finite convergence of successive SDP relaxation methods | 2002-11-20 | Paper |
| On the Slater condition for the SDP relaxations of nonconvex sets | 2002-07-03 | Paper |
| Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems | 2002-02-12 | Paper |
| Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization | 2001-11-26 | Paper |
| On a Representation of the Matching Polytope Via Semidefinite Liftings | 2001-11-26 | Paper |
| Generalization of primal-dual interior-point methods to convex optimization problems in conic form | 2001-10-14 | Paper |
| On the generic properties of convex optimization problems in conic form | 2001-10-03 | Paper |
| Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. | 2001-07-02 | Paper |
| On the condition numbers for polyhedra in Karmarkar's form | 2001-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517104 | 2000-11-23 | Paper |
| Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets | 2000-10-19 | Paper |
| Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems | 2000-08-20 | Paper |
| Characterization of the barrier parameter of homogeneous convex cones | 1999-06-03 | Paper |
| A constant-potential infeasible-start interior-point algorithm with computational experiments and applications | 1998-04-13 | Paper |
| Strong Duality for Semidefinite Programming | 1998-02-10 | Paper |
| On the interplay among entropy, variable metrics and potential functions in interior-point algorithms | 1998-02-05 | Paper |
| Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming | 1997-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687265 | 1996-12-11 | Paper |
| On the convergence of primal-dual interior-point methods with wide neighborhoods | 1995-05-15 | Paper |
| On the complexity of preflow-push algorithms for maximum-flow problems | 1995-01-12 | Paper |
| Constant potential primal-dual algorithms: A framework | 1994-12-11 | Paper |
| Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms | 1994-10-04 | Paper |
| A New Triangulation for Simplicial Algorithms | 1993-06-29 | Paper |
| On the convexity of a function related to the Wagner-Whitin model | 1993-01-16 | Paper |
| Some fundamental properties of successive convex relaxation methods on LCP and related problems | N/A | Paper |
| Everything is possible: constructing spectrahedra with prescribed facial dimensions | N/A | Paper |
