| Publication | Date of Publication | Type |
|---|
A simple nearly optimal restart scheme for speeding up first-order methods
Foundations of Computational Mathematics | 2023-04-14 | Paper |
| A Different Perspective On The Stochastic Convex Feasibility Problem | 2021-08-26 | Paper |
Accelerated first-order methods for hyperbolic programming
Mathematical Programming. Series A. Series B | 2019-02-07 | Paper |
A Simple Nearly-Optimal Restart Scheme For Speeding-Up First Order Methods
(available as arXiv preprint) | 2018-02-28 | Paper |
``Efficient subgradient methods for general convex optimization
SIAM Journal on Optimization | 2016-12-13 | Paper |
| A Framework for Applying Subgradient Methods to Conic Optimization Problems | 2015-03-09 | Paper |
| A Polynomial-Time Affine-Scaling Method for Semidefinite and Hyperbolic Programming | 2014-10-24 | Paper |
| Efficient First-Order Methods for Linear Programming and Semidefinite Programming | 2014-09-19 | Paper |
Central swaths
Foundations of Computational Mathematics | 2013-08-09 | Paper |
Hyperbolic programs, and their derivative relaxations
Foundations of Computational Mathematics | 2006-10-27 | Paper |
A mathematical view of interior-point methods in convex optimization
MPS SIAM Series on Optimization | 2001-11-12 | Paper |
Computing approximate solutions for convex conic systems of constraints
Mathematical Programming. Series A. Series B | 2001-05-03 | Paper |
| scientific article; zbMATH DE number 1157657 (Why is no real title available?) | 1998-09-13 | Paper |
Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
SIAM Journal on Optimization | 1997-10-19 | Paper |
Linear programming, complexity theory and elementary functional analysis
Mathematical Programming. Series A. Series B | 1997-01-12 | Paper |
Incorporating Condition Measures into the Complexity Theory of Linear Programming
SIAM Journal on Optimization | 1996-06-04 | Paper |
Some perturbation theory for linear programming
Mathematical Programming. Series A. Series B | 1994-09-26 | Paper |
It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
Journal of Complexity | 1994-04-12 | Paper |
| scientific article; zbMATH DE number 503388 (Why is no real title available?) | 1994-02-22 | Paper |
On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
SIAM Journal on Computing | 1993-03-09 | Paper |
| scientific article; zbMATH DE number 66690 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 66626 (Why is no real title available?) | 1992-09-27 | Paper |
On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
Journal of Symbolic Computation | 1992-06-28 | Paper |
On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
Journal of Symbolic Computation | 1992-06-28 | Paper |
On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
Journal of Symbolic Computation | 1992-06-28 | Paper |
Unified complexity analysis for Newton LP methods
Mathematical Programming. Series A. Series B | 1992-06-28 | Paper |
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
SIAM Journal on Computing | 1989-01-01 | Paper |
A polynomial-time algorithm, based on Newton's method, for linear programming
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
Rudiments of an average case complexity theory for piecewise-linear path following algorithms
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
On the worst-case arithmetic complexity of approximating zeros of polynomials
Journal of Complexity | 1987-01-01 | Paper |
On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
Mathematics of Operations Research | 1987-01-01 | Paper |
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
Mathematical Programming | 1985-01-01 | Paper |
On the cost of approximating all roots of a complex polynomial
Mathematical Programming | 1985-01-01 | Paper |
