| Publication | Date of Publication | Type |
|---|
An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities
Mathematics of Operations Research | 2024-03-05 | Paper |
The ellipsoid method redux
| 2023-01-18 | Paper |
On max-\(k\)-sums
Mathematical Programming. Series A. Series B | 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
IEEE Transactions on Image Processing | 2017-10-27 | Paper |
Minimum-volume ellipsoids. Theory and algorithms
MOS SIAM Series on Optimization | 2016-10-14 | Paper |
Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
Mathematics of Operations Research | 2016-08-10 | Paper |
On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
Weighted distance weighted discrimination and its asymptotic properties
Journal of the American Statistical Association | 2015-06-11 | Paper |
An improved Kalai-Kleitman bound for the diameter of a polyhedron
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Book Review: The basic George B. Dantzig
Bulletin of the American Mathematical Society | 2014-07-29 | Paper |
A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
Computational Geometry | 2013-03-12 | Paper |
A robust robust optimization result
Operations Research Letters | 2012-07-06 | Paper |
Another derivation of the Karmarkar direction for linear programming
| 2010-06-25 | Paper |
Distance-Weighted Discrimination
Journal of the American Statistical Association | 2009-06-12 | Paper |
Interior-point methods for optimization
Acta Numerica | 2009-03-03 | Paper |
Largest dual ellipsoids inscribed in dual cones
Mathematical Programming. Series A. Series B | 2008-12-16 | Paper |
Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
Optimization Methods \& Software | 2008-04-29 | Paper |
scientific article; zbMATH DE number 5239114 (Why is no real title available?)
| 2008-02-22 | Paper |
Dual versus primal-dual interior-point methods for linear and conic programming
Mathematical Programming. Series A. Series B | 2008-01-21 | Paper |
Distance-Weighted Discrimination
Journal of the American Statistical Association | 2007-12-01 | Paper |
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Discrete Applied Mathematics | 2007-09-18 | Paper |
Semidefinite optimization
Acta Numerica | 2006-12-18 | Paper |
Detecting infeasibility in infeasible-interior-point methods for optimization
| 2006-08-28 | Paper |
Two new proofs of Afriat's theorem
Economic Theory | 2005-02-11 | Paper |
Solving semidefinite-quadratic-linear programs using SDPT3
Mathematical Programming | 2003-10-29 | Paper |
Solving semidefinite-quadratic-linear programs using SDPT3
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
Foundations of Computational Mathematics | 2003-06-23 | Paper |
Solving semidefinite-quadratic-linear programs using SDPT3
Mathematical Programming | 2003-02-01 | Paper |
Solving semidefinite-quadratic-linear programs using SDPT3
Mathematical Programming. Series A. Series B | 2003-02-01 | Paper |
The many facets of linear programming
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
An interior-point approach to sensitivity analysis in degenerate linear programs
SIAM Journal on Optimization | 2002-04-23 | Paper |
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
Mathematical Programming. Series A. Series B | 2002-02-12 | Paper |
Erratum: Probabilistic models for linear programming
Mathematics of Operations Research | 2001-11-26 | Paper |
On two homogeneous self-dual approaches to linear programming and its extensions.
Mathematical Programming. Series A. Series B | 2001-10-03 | Paper |
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
Mathematical Programming. Series A. Series B | 2001-06-26 | Paper |
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Optimization Methods \& Software | 2000-12-06 | Paper |
scientific article; zbMATH DE number 1534296 (Why is no real title available?)
| 2000-11-23 | Paper |
A study of search directions in primal-dual interior-point methods for semidefinite programming
Optimization Methods \& Software | 2000-09-14 | Paper |
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
Mathematical Programming. Series A. Series B | 2000-07-21 | Paper |
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
Mathematical Programming. Series A. Series B | 1999-06-28 | Paper |
scientific article; zbMATH DE number 1182932 (Why is no real title available?)
| 1999-01-19 | Paper |
On the Nesterov--Todd Direction in Semidefinite Programming
SIAM Journal on Optimization | 1998-09-21 | Paper |
Primal-Dual Interior-Point Methods for Self-Scaled Cones
SIAM Journal on Optimization | 1998-05-12 | Paper |
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
Computational Optimization and Applications | 1998-02-05 | Paper |
Solving LP Problems via Weighted Centers
SIAM Journal on Optimization | 1997-10-08 | Paper |
Potential-reduction methods in mathematical programming
Mathematical Programming. Series A. Series B | 1997-07-23 | Paper |
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Mathematics of Operations Research | 1997-06-09 | 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 1971715 (Why is no real title available?)
| 1997-01-01 | Paper |
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
Annals of Operations Research | 1996-07-01 | Paper |
Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
Mathematics of Operations Research | 1995-09-17 | Paper |
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
Mathematics of Operations Research | 1995-07-31 | Paper |
Reducing horizontal linear complementarity problems
Linear Algebra and its Applications | 1995-07-24 | Paper |
scientific article; zbMATH DE number 554743 (Why is no real title available?)
| 1995-06-30 | Paper |
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
SIAM Journal on Optimization | 1995-05-30 | Paper |
Scaling, shifting and weighting in interior-point methods
Computational Optimization and Applications | 1995-01-15 | Paper |
The ellipsoid algorithm using parallel cuts
Computational Optimization and Applications | 1994-12-12 | Paper |
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Mathematics of Operations Research | 1994-11-17 | Paper |
scientific article; zbMATH DE number 653032 (Why is no real title available?)
| 1994-10-12 | Paper |
Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms
SIAM Journal on Optimization | 1994-10-04 | Paper |
Interior-point algorithms for semi-infinite programming
Mathematical Programming. Series A. Series B | 1994-09-26 | Paper |
Commentary—Theory and Practice for Interior-Point Methods
ORSA Journal on Computing | 1994-05-10 | Paper |
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Mathematics of Operations Research | 1994-04-12 | Paper |
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
Mathematical Programming. Series A. Series B | 1994-03-10 | Paper |
Combining phase I and phase II in a potential reduction algorithm for linear programming
Mathematical Programming. Series A. Series B | 1993-08-22 | Paper |
A New Triangulation for Simplicial Algorithms
SIAM Journal on Discrete Mathematics | 1993-06-29 | Paper |
On combined phase 1-phase 2 projective methods for linear programming
Algorithmica | 1993-04-01 | Paper |
Todd's low-complexity algorithm is a predictor-corrector path-following method
Operations Research Letters | 1993-01-16 | Paper |
A Low Complexity Interior-Point Algorithm for Linear Programming
SIAM Journal on Optimization | 1993-01-16 | Paper |
An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
SIAM Journal on Optimization | 1993-01-16 | Paper |
Solving combinatorial optimization problems using Karmarkar's algorithm
Mathematical Programming. Series A. Series B | 1992-12-17 | Paper |
On Anstreicher's combined phase I-phase II projective algorithm for linear programming
Mathematical Programming. Series A. Series B | 1992-10-06 | Paper |
Probabilistic Models for Linear Programming
Mathematics of Operations Research | 1992-06-28 | Paper |
An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
Containing and shrinking ellipsoids in the path-following algorithm
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
The affine-scaling direction for linear programming is a limit of projective-scaling directions
Linear Algebra and its Applications | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4197736 (Why is no real title available?)
| 1990-01-01 | Paper |
A Centered Projective Algorithm for Linear Programming
Mathematics of Operations Research | 1990-01-01 | Paper |
A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
Operations Research | 1990-01-01 | Paper |
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
Mathematics of Operations Research | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4199962 (Why is no real title available?)
| 1990-01-01 | Paper |
On Convergence Properties of Algorithms for Unconstrained Minimization
IMA Journal of Numerical Analysis | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4119923 (Why is no real title available?)
| 1989-01-01 | Paper |
A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
SIAM Journal on Matrix Analysis and Applications | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4062814 (Why is no real title available?)
| 1988-01-01 | Paper |
Symmetry and positive definiteness in oriented matroids
European Journal of Combinatorics | 1988-01-01 | Paper |
Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
Mathematics of Operations Research | 1988-01-01 | Paper |
Optimal Conditioning and Convergence in Rank One Quasi-Newton Updates
SIAM Journal on Numerical Analysis | 1988-01-01 | Paper |
Exploiting special structure in Karmarkar's linear programming algorithm
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4137490 (Why is no real title available?)
| 1987-01-01 | Paper |
An extension of Karmarkar's algorithm for linear programming using dual variables
Algorithmica | 1986-01-01 | Paper |
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
Mathematical Programming | 1986-01-01 | Paper |
The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm
Operations Research Letters | 1986-01-01 | Paper |
Linear quadratic programming in oriented matroids
Journal of Combinatorial Theory. Series B | 1985-01-01 | Paper |
‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
Mathematical Programming | 1985-01-01 | Paper |
The Ellipsoid Method Generates Dual Variables
Mathematics of Operations Research | 1985-01-01 | Paper |
Quasi-Newton Updates in Abstract Vector Spaces
SIAM Review | 1984-01-01 | Paper |
$J'$: A New Triangulation of $R^n $
SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
Complementarity in Oriented Matroids
SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
New results on the average behavior of simplex algorithms
Bulletin of the American Mathematical Society | 1984-01-01 | Paper |
Piecewise-Linear Homotopy Algorithms for Sparse Systems of Nonlinear Equations
SIAM Journal on Control and Optimization | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3864053 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3815305 (Why is no real title available?)
| 1983-01-01 | Paper |
Large-scale linear programming: Geometry, working bases and factorizations
Mathematical Programming | 1983-01-01 | Paper |
An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
Mathematical Programming | 1983-01-01 | Paper |
On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
Mathematics of Operations Research | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3936945 (Why is no real title available?)
| 1982-01-01 | Paper |
Modifications and implementation of the ellipsoid algorithm for linear programming
Mathematical Programming | 1982-01-01 | Paper |
An implementation of the simplex method for linear programming problems with variable upper bounds
Mathematical Programming | 1982-01-01 | Paper |
On the computational complexity of piecewise-linear homotopy algorithms
Mathematical Programming | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3780480 (Why is no real title available?)
| 1982-01-01 | Paper |
A constructive proof of Tucker's combinatorial lemma
Journal of Combinatorial Theory. Series A | 1981-01-01 | Paper |
Feature Article—The Ellipsoid Method: A Survey
Operations Research | 1981-01-01 | Paper |
Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere
Mathematics of Operations Research | 1981-01-01 | Paper |
Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation
Operations Research | 1980-01-01 | Paper |
Exploiting structure in piecewise-linear homotopy algorithms for solving equations
Mathematical Programming | 1980-01-01 | Paper |
Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths
Mathematics of Operations Research | 1980-01-01 | Paper |
A Note on Optimally Dissecting Simplices
Mathematics of Operations Research | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3746336 (Why is no real title available?)
| 1980-01-01 | Paper |
A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
Mathematical Programming | 1980-01-01 | Paper |
The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
Mathematics of Operations Research | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3703887 (Why is no real title available?)
| 1980-01-01 | Paper |
A variable-dimension simplicial algorithm for antipodal fixed-point theorems
Numerical Functional Analysis and Optimization | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3671342 (Why is no real title available?)
| 1979-01-01 | Paper |
Piecewise linear paths to minimize convex functions may not be monotonic
Mathematical Programming | 1979-01-01 | Paper |
A note on computing equilibria in economies with activity analysis models of production
Journal of Mathematical Economics | 1979-01-01 | Paper |
Bimatrix games—an addendum
Mathematical Programming | 1978-01-01 | Paper |
On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm
Mathematics of Operations Research | 1978-01-01 | Paper |
Efficient Acceleration Techniques for Fixed Point Algorithms
SIAM Journal on Numerical Analysis | 1978-01-01 | Paper |
Note—Solving the Generalized Market Area Problem
Management Science | 1978-01-01 | Paper |
Improving the convergence of fixed-point algorithms
Mathematical Programming Studies | 1978-01-01 | Paper |
Optimal Dissection of Simplices
SIAM Journal on Applied Mathematics | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3661134 (Why is no real title available?)
| 1977-01-01 | Paper |
A combinatorial generalization of polytopes
Journal of Combinatorial Theory. Series B | 1976-01-01 | Paper |
The computation of fixed points and applications
Lecture Notes in Economics and Mathematical Systems | 1976-01-01 | Paper |
On triangulations for computing fixed points
Mathematical Programming | 1976-01-01 | Paper |
Extensions of Lemke's algorithm for the linear complementarity problem
Journal of Optimization Theory and Applications | 1976-01-01 | Paper |
On triangulations for computing fixed points
Mathematical Programming | 1976-01-01 | Paper |
Characterizing binary simplicial matroids
Discrete Mathematics | 1976-01-01 | Paper |
Orientation in Complementary Pivot Algorithms
Mathematics of Operations Research | 1976-01-01 | Paper |
A generalized complementary pivoting algorithm
Mathematical Programming | 1974-01-01 | Paper |
scientific article; zbMATH DE number 3407430 (Why is no real title available?)
| 1973-01-01 | Paper |
