| Publication | Date of Publication | Type |
|---|
| An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities | 2024-03-05 | Paper |
| The ellipsoid method redux | 2023-01-18 | Paper |
| On max-\(k\)-sums | 2018-09-28 | Paper |
| Can $n^d + 1$ unit right $d$-simplices cover a right $d$-simplex with shortest side $n + \epsilon$? | 2017-11-22 | Paper |
| Augmented Active Surface Model for the Recovery of Small Structures in CT | 2017-10-27 | Paper |
| Minimum-Volume Ellipsoids | 2016-10-14 | Paper |
| Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers | 2016-08-10 | Paper |
| On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 | 2016-04-26 | Paper |
| Weighted Distance Weighted Discrimination and Its Asymptotic Properties | 2015-06-11 | Paper |
| An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron | 2015-04-17 | Paper |
| Book Review: The basic George B. Dantzig | 2014-07-29 | Paper |
| A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms | 2013-03-12 | Paper |
| A robust robust optimization result | 2012-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3570229 | 2010-06-25 | Paper |
| Distance-Weighted Discrimination | 2009-06-12 | Paper |
| Interior-point methods for optimization | 2009-03-03 | Paper |
| Largest dual ellipsoids inscribed in dual cones | 2008-12-16 | Paper |
| Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids | 2008-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442492 | 2008-02-22 | Paper |
| Dual versus primal-dual interior-point methods for linear and conic programming | 2008-01-21 | Paper |
| Distance-Weighted Discrimination | 2007-12-01 | Paper |
| On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids | 2007-09-18 | Paper |
| Semidefinite optimization | 2006-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5482452 | 2006-08-28 | Paper |
| Two new proofs of Afriat's theorem | 2005-02-11 | Paper |
| Solving semidefinite-quadratic-linear programs using SDPT3 | 2003-10-29 | Paper |
| On the Riemannian geometry defined by self-concordant barriers and interior-point methods. | 2003-06-23 | Paper |
| Solving semidefinite-quadratic-linear programs using SDPT3 | 2003-02-01 | Paper |
| The many facets of linear programming | 2002-12-01 | Paper |
| An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs | 2002-04-23 | Paper |
| Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems | 2002-02-12 | Paper |
| Erratum: Probabilistic Models for Linear Programming | 2001-11-26 | Paper |
| On two homogeneous self-dual approaches to linear programming and its extensions. | 2001-10-03 | Paper |
| Sensitivity analysis in linear programming and semidefinite programming using interior-point methods | 2001-06-26 | Paper |
| SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 | 2000-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517105 | 2000-11-23 | Paper |
| A study of search directions in primal-dual interior-point methods for semidefinite programming | 2000-09-14 | Paper |
| Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems | 2000-07-21 | Paper |
| Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming | 1999-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401029 | 1999-01-19 | Paper |
| On the Nesterov--Todd Direction in Semidefinite Programming | 1998-09-21 | Paper |
| Primal-Dual Interior-Point Methods for Self-Scaled Cones | 1998-05-12 | Paper |
| On the interplay among entropy, variable metrics and potential functions in interior-point algorithms | 1998-02-05 | Paper |
| Solving LP Problems via Weighted Centers | 1997-10-08 | Paper |
| Potential-reduction methods in mathematical programming | 1997-07-23 | Paper |
| Self-Scaled Barriers and Interior-Point Methods for Convex Programming | 1997-06-09 | Paper |
| Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming | 1997-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4421362 | 1997-01-01 | Paper |
| A lower bound on the number of iterations of long-step primal-dual linear programming algorithms | 1996-07-01 | 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 Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming | 1995-07-31 | Paper |
| Reducing horizontal linear complementarity problems | 1995-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288560 | 1995-06-30 | Paper |
| Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming | 1995-05-30 | Paper |
| Scaling, shifting and weighting in interior-point methods | 1995-01-15 | Paper |
| The ellipsoid algorithm using parallel cuts | 1994-12-12 | Paper |
| An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm | 1994-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4308907 | 1994-10-12 | Paper |
| Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms | 1994-10-04 | Paper |
| Interior-point algorithms for semi-infinite programming | 1994-09-26 | Paper |
| Commentary—Theory and Practice for Interior-Point Methods | 1994-05-10 | Paper |
| On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming | 1994-04-12 | Paper |
| On the complexity of approximating the maximal inscribed ellipsoid for a polytope | 1994-03-10 | Paper |
| Combining phase I and phase II in a potential reduction algorithm for linear programming | 1993-08-22 | Paper |
| A New Triangulation for Simplicial Algorithms | 1993-06-29 | Paper |
| On combined phase 1-phase 2 projective methods for linear programming | 1993-04-01 | Paper |
| Todd's low-complexity algorithm is a predictor-corrector path-following method | 1993-01-16 | Paper |
| A Low Complexity Interior-Point Algorithm for Linear Programming | 1993-01-16 | Paper |
| An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming | 1993-01-16 | Paper |
| Solving combinatorial optimization problems using Karmarkar's algorithm | 1992-12-17 | Paper |
| On Anstreicher's combined phase I-phase II projective algorithm for linear programming | 1992-10-06 | Paper |
| Probabilistic Models for Linear Programming | 1992-06-28 | Paper |
| An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem | 1992-06-27 | Paper |
| Containing and shrinking ellipsoids in the path-following algorithm | 1992-06-25 | Paper |
| The affine-scaling direction for linear programming is a limit of projective-scaling directions | 1991-01-01 | Paper |
| A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202835 | 1990-01-01 | Paper |
| Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions | 1990-01-01 | Paper |
| A Centered Projective Algorithm for Linear Programming | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348698 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733658 | 1989-01-01 | Paper |
| A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables | 1989-01-01 | Paper |
| On Convergence Properties of Algorithms for Unconstrained Minimization | 1989-01-01 | Paper |
| Symmetry and positive definiteness in oriented matroids | 1988-01-01 | Paper |
| Exploiting special structure in Karmarkar's linear programming algorithm | 1988-01-01 | Paper |
| Optimal Conditioning and Convergence in Rank One Quasi-Newton Updates | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796957 | 1988-01-01 | Paper |
| Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470215 | 1987-01-01 | Paper |
| Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems | 1986-01-01 | Paper |
| The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm | 1986-01-01 | Paper |
| An extension of Karmarkar's algorithm for linear programming using dual variables | 1986-01-01 | Paper |
| Linear quadratic programming in oriented matroids | 1985-01-01 | Paper |
| The Ellipsoid Method Generates Dual Variables | 1985-01-01 | Paper |
| ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems | 1985-01-01 | Paper |
| Complementarity in Oriented Matroids | 1984-01-01 | Paper |
| $J'$: A New Triangulation of $R^n $ | 1984-01-01 | Paper |
| New results on the average behavior of simplex algorithms | 1984-01-01 | Paper |
| Quasi-Newton Updates in Abstract Vector Spaces | 1984-01-01 | Paper |
| Piecewise-Linear Homotopy Algorithms for Sparse Systems of Nonlinear Equations | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3331881 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3662938 | 1983-01-01 | Paper |
| Large-scale linear programming: Geometry, working bases and factorizations | 1983-01-01 | Paper |
| An efficient simplicial algorithm for computing a zero of a convex union of smooth functions | 1983-01-01 | Paper |
| On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid | 1982-01-01 | Paper |
| On the computational complexity of piecewise-linear homotopy algorithms | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3710314 | 1982-01-01 | Paper |
| Modifications and implementation of the ellipsoid algorithm for linear programming | 1982-01-01 | Paper |
| An implementation of the simplex method for linear programming problems with variable upper bounds | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959350 | 1982-01-01 | Paper |
| Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere | 1981-01-01 | Paper |
| A constructive proof of Tucker's combinatorial lemma | 1981-01-01 | Paper |
| Feature Article—The Ellipsoid Method: A Survey | 1981-01-01 | Paper |
| A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization | 1980-01-01 | Paper |
| Exploiting structure in piecewise-linear homotopy algorithms for solving equations | 1980-01-01 | Paper |
| A Note on Optimally Dissecting Simplices | 1980-01-01 | Paper |
| Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation | 1980-01-01 | Paper |
| Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3896415 | 1980-01-01 | Paper |
| A variable-dimension simplicial algorithm for antipodal fixed-point theorems | 1980-01-01 | Paper |
| The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3930547 | 1980-01-01 | Paper |
| A note on computing equilibria in economies with activity analysis models of production | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3868472 | 1979-01-01 | Paper |
| Piecewise linear paths to minimize convex functions may not be monotonic | 1979-01-01 | Paper |
| Note—Solving the Generalized Market Area Problem | 1978-01-01 | Paper |
| Bimatrix games—an addendum | 1978-01-01 | Paper |
| Optimal Dissection of Simplices | 1978-01-01 | Paper |
| On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm | 1978-01-01 | Paper |
| Efficient Acceleration Techniques for Fixed Point Algorithms | 1978-01-01 | Paper |
| Improving the convergence of fixed-point algorithms | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3859595 | 1977-01-01 | Paper |
| A combinatorial generalization of polytopes | 1976-01-01 | Paper |
| Extensions of Lemke's algorithm for the linear complementarity problem | 1976-01-01 | Paper |
| The computation of fixed points and applications | 1976-01-01 | Paper |
| Characterizing binary simplicial matroids | 1976-01-01 | Paper |
| Orientation in Complementary Pivot Algorithms | 1976-01-01 | Paper |
| On triangulations for computing fixed points | 1976-01-01 | Paper |
| On triangulations for computing fixed points | 1976-01-01 | Paper |
| A generalized complementary pivoting algorithm | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672441 | 1973-01-01 | Paper |
