| Publication | Date of Publication | Type |
|---|
Total dual dyadicness and dyadic generating sets
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Graphs with large girth and chromatic number are hard for Nullstellensatz
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Linear optimization over homogeneous matrix cones
Acta Numerica | 2023-09-12 | Paper |
| Dyadic linear programming and extensions | 2023-09-08 | Paper |
Testing idealness in the filter oracle model
Operations Research Letters | 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
(available as arXiv preprint) | 2022-08-16 | Paper |
Status determination by interior-point methods for convex optimization problems in domain-driven form
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
Clean clutters and dyadic fractional packings
SIAM Journal on Discrete Mathematics | 2022-04-20 | Paper |
Testing idealness in the filter oracle model
(available as arXiv preprint) | 2022-02-15 | Paper |
On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices
Linear Algebra and its Applications | 2021-02-12 | Paper |
Primal-dual interior-point methods for domain-driven formulations
(available as arXiv preprint) | 2020-09-01 | Paper |
Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture
Information Processing Letters | 2020-08-04 | Paper |
A notion of total dual integrality for convex, semidefinite, and extended formulations
SIAM Journal on Discrete Mathematics | 2020-02-20 | Paper |
Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
SIAM Journal on Optimization | 2019-11-08 | Paper |
Facially dual complete (nice) cones and lexicographic tangents
SIAM Journal on Optimization | 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
Discrete Optimization | 2018-08-17 | Paper |
| Strict Complementarity in MaxCut SDP | 2018-06-04 | Paper |
A utility theory based interactive approach to robustness in linear optimization
Journal of Global 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
RAIRO - Operations Research | 2017-06-15 | Paper |
An axiomatic duality framework for the theta body and related convex corners
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
Vertices of spectrahedra arising from the elliptope, the theta body, and their relatives
SIAM Journal on Optimization | 2017-01-13 | Paper |
Efficient heuristic algorithms for maximum utility product pricing problems
Computers & Operations Research | 2016-11-17 | Paper |
Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
Journal of Scheduling | 2016-11-16 | Paper |
Perturbed sums-of-squares theorem for polynomial optimization and its applications
Optimization Methods & Software | 2016-06-10 | Paper |
A search for quantum coin-flipping protocols using optimization techniques
Mathematical Programming. Series A. Series B | 2016-04-04 | Paper |
A comprehensive analysis of polyhedral lift-and-project methods
SIAM Journal on Discrete Mathematics | 2016-03-04 | Paper |
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
| Interior-point algorithms for convex optimization based on primal-dual metrics | 2014-11-08 | Paper |
| A gentle introduction to optimization | 2014-09-25 | Paper |
\(s\)-goodness for low-rank matrix recovery
Abstract and Applied Analysis | 2013-09-19 | Paper |
Some advances on lovász-schrijver \(N_+(\cdot)\) relaxations of the fractional stable set polytope
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Near-perfect graphs with polyhedral \(N_+(G)\)
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Optimization problems over unit-distance representations of graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Optimization problems over unit-distance representations of graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Strong duality and minimal representations for cone optimization
Computational Optimization and Applications | 2013-01-04 | Paper |
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
Existence and uniqueness of solutions for homogeneous cone complementarity problems
Journal of Optimization Theory and Applications | 2012-06-26 | Paper |
Complexity analyses of Bienstock-Zuckerberg and lasserre relaxations on the matching and stable set polytopes
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Maximum utility product pricing models and algorithms based on reservation price
Computational Optimization and Applications | 2011-05-11 | Paper |
Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
Journal of Optimization Theory and Applications | 2011-05-11 | Paper |
Polyhedral and semidefinite programming methods in combinatorial optimization
Fields Institute Monographs | 2010-12-14 | Paper |
Self-concordant barriers for convex approximations of structured convex sets
Foundations of Computational Mathematics | 2010-10-08 | Paper |
| The Fischer-Burmeister complementarity function on Euclidean Jordan algebras | 2010-06-11 | Paper |
Clarke generalized Jacobian of the projection onto symmetric cones
Set-Valued and Variational Analysis | 2009-08-11 | Paper |
VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
Asia-Pacific Journal of Operational Research | 2009-06-30 | Paper |
Lehman matrices
Journal of Combinatorial Theory. Series B | 2009-06-23 | Paper |
On the polyhedral lift-and-project methods and the fractional stable set polytope
Discrete Optimization | 2009-05-07 | Paper |
| Homogeneous Cone Complementarity Problems and $P$ Properties | 2009-04-11 | Paper |
Large scale portfolio optimization with piecewise linear transaction costs
Optimization Methods & Software | 2009-02-23 | Paper |
Invariance and efficiency of convex representations
Mathematical Programming. Series A. Series B | 2008-01-21 | Paper |
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
Discrete Applied Mathematics | 2007-11-30 | Paper |
Clustering via minimum volume ellipsoids
Computational Optimization and Applications | 2007-10-12 | Paper |
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Mathematics of Operations Research | 2005-11-11 | Paper |
On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping
Mathematics of Operations Research | 2005-11-11 | Paper |
Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming
Linear Algebra and its Applications | 2005-06-01 | Paper |
``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
Mathematical Programming. Series A. Series B | 2005-04-19 | Paper |
Lift-and-project ranks and antiblocker duality
Operations Research Letters | 2004-11-19 | Paper |
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
Mathematical Programming. Series A. Series B | 2004-10-05 | Paper |
The stable set problem and the lift-and-project ranks of graphs
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
Mathematical Programming. Series A. Series B | 2004-02-10 | Paper |
Some fundamental properties of successive convex relaxation methods on LCP and related problems
Journal of Global Optimization | 2003-06-09 | Paper |
| scientific article; zbMATH DE number 1859212 (Why is no real title available?) | 2003-04-23 | Paper |
On the finite convergence of successive SDP relaxation methods
European Journal of Operational Research | 2002-11-20 | Paper |
On the Slater condition for the SDP relaxations of nonconvex sets
Operations Research Letters | 2002-07-03 | Paper |
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
Mathematical Programming. Series A. Series B | 2002-02-12 | Paper |
On a representation of the matching polytope via semidefinite liftings
Mathematics of Operations Research | 2001-11-26 | Paper |
Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization
Mathematics of Operations Research | 2001-11-26 | Paper |
Generalization of primal-dual interior-point methods to convex optimization problems in conic form
Foundations of Computational Mathematics | 2001-10-14 | Paper |
On the generic properties of convex optimization problems in conic form
Mathematical Programming. Series A. Series B | 2001-10-03 | Paper |
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
Mathematical Programming. Series A. Series B | 2001-07-02 | Paper |
On the condition numbers for polyhedra in Karmarkar's form
Operations Research Letters | 2001-03-04 | Paper |
| scientific article; zbMATH DE number 1534295 (Why is no real title available?) | 2000-11-23 | Paper |
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
SIAM Journal on Optimization | 2000-10-19 | Paper |
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
Optimization Methods & Software | 2000-08-20 | Paper |
Characterization of the barrier parameter of homogeneous convex cones
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
Computational Optimization and Applications | 1998-04-13 | Paper |
Strong Duality for Semidefinite Programming
SIAM Journal on Optimization | 1998-02-10 | Paper |
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
Computational Optimization and Applications | 1998-02-05 | Paper |
Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming
Mathematics of Operations Research | 1997-02-20 | Paper |
| scientific article; zbMATH DE number 956857 (Why is no real title available?) | 1996-12-11 | Paper |
On the convergence of primal-dual interior-point methods with wide neighborhoods
Computational Optimization and Applications | 1995-05-15 | Paper |
On the complexity of preflow-push algorithms for maximum-flow problems
Algorithmica | 1995-01-12 | Paper |
Constant potential primal-dual algorithms: A framework
Mathematical Programming. Series A. Series B | 1994-12-11 | Paper |
Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms
SIAM Journal on Optimization | 1994-10-04 | Paper |
A New Triangulation for Simplicial Algorithms
SIAM Journal on Discrete Mathematics | 1993-06-29 | Paper |
On the convexity of a function related to the Wagner-Whitin model
Operations Research Letters | 1993-01-16 | Paper |
Some fundamental properties of successive convex relaxation methods on LCP and related problems
(available as arXiv preprint) | N/A | Paper |
Everything is possible: constructing spectrahedra with prescribed facial dimensions
(available as arXiv preprint) | N/A | Paper |
