| Publication | Date of Publication | Type |
|---|
| An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities | 2024-03-05 | Paper |
| Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier | 2023-05-02 | Paper |
| Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses | 2023-01-04 | Paper |
| Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization | 2021-04-23 | Paper |
| New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure | 2018-08-22 | Paper |
| Accelerating Greedy Coordinate Descent Methods | 2018-06-06 | Paper |
| A new perspective on boosting in linear regression via subgradient optimization and relatives | 2018-02-14 | Paper |
| Relatively Smooth Convex Optimization by First-Order Methods, and Applications | 2018-02-14 | Paper |
| An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion | 2017-03-10 | Paper |
| New analysis and results for the Frank-Wolfe method | 2016-02-23 | Paper |
| Fabrication-Adaptive Optimization with an Application to Photonic Crystal Design | 2014-08-11 | Paper |
| An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems | 2013-06-24 | Paper |
| Optimizing Product Line Designs: Efficient Methods and Comparisons | 2012-02-29 | Paper |
| An Efficient Rescaled Perceptron Algorithm for Conic Systems | 2011-04-27 | Paper |
| Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model | 2011-04-27 | Paper |
| On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection | 2009-08-20 | Paper |
| Computation of Minimum-Volume Covering Ellipsoids | 2009-07-17 | Paper |
| Projective re-normalization for improving the behavior of a homogeneous conic linear system | 2009-05-04 | Paper |
| A geometric analysis of Renegar's condition number, and its interplay with conic curvature | 2009-04-24 | Paper |
| On the symmetry function of a convex set | 2008-01-21 | Paper |
| An Efficient Re-scaled Perceptron Algorithm for Conic Systems | 2008-01-03 | Paper |
| Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems | 2007-03-05 | Paper |
| On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems | 2006-11-17 | Paper |
| On the behavior of the homogeneous self-dual model for conic convex optimization | 2006-06-14 | Paper |
| On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System | 2005-11-11 | Paper |
| On an Extension of Condition Number Theory to Nonconic Convex Optimization | 2005-11-11 | Paper |
| Complexity of convex optimization using geometry-based measures and a reference point | 2004-07-01 | Paper |
| On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization | 2004-01-19 | Paper |
| Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization | 2004-01-19 | Paper |
| Solution methodologies for the smallest enclosing circle problem | 2003-06-09 | Paper |
| A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems | 2002-04-23 | Paper |
| Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program | 2001-03-19 | Paper |
| Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496026 | 2001-02-22 | Paper |
| Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system | 2000-04-03 | Paper |
| Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm | 1999-11-24 | Paper |
| Condition measures and properties of the central trajectory of a linear program | 1999-06-03 | Paper |
| Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm | 1997-02-13 | Paper |
| An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution | 1996-10-24 | Paper |
| Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables | 1995-09-17 | Paper |
| A Potential Reduction Algorithm with User-Specified Phase I–Phase II Balance for Solving a Linear Program from an Infeasible Warm Start | 1995-07-13 | Paper |
| Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem | 1993-08-17 | Paper |
| Prior reduced fill-in in solving equations in interior point algorithms | 1993-01-16 | Paper |
| A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming | 1992-06-28 | Paper |
| A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start | 1992-06-27 | Paper |
| Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function | 1992-06-26 | Paper |
| Theoretical efficiency of a shifted-barrier-function algorithm for linear programming | 1991-01-01 | Paper |
| Optimal Investment in Product-Flexible Manufacturing Capacity | 1990-01-01 | Paper |
| Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron | 1989-01-01 | Paper |
| An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope | 1988-01-01 | Paper |
| Dual gauge programs, with applications to quadratic programming and the minimum-norm problem | 1987-01-01 | Paper |
| Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube | 1986-01-01 | Paper |
| On the complexity of four polyhedral set containment problems | 1985-01-01 | Paper |
| Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients | 1985-01-01 | Paper |
| Variable Dimension Complexes Part I: Basic Theory | 1984-01-01 | Paper |
| Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology | 1984-01-01 | Paper |
| Optimal scaling of balls and polyhedra | 1982-01-01 | Paper |
| A constructive proof of Tucker's combinatorial lemma | 1981-01-01 | Paper |
