default search action
Michael J. Todd
Person information
- affiliation: Cornell University, Ithaca, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j87]Jourdain B. Lamperski
, Robert M. Freund
An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities. Math. Oper. Res. 49(1): 204-231 (2024)
2010 – 2019
- 2018
- [j86]Michael J. Todd
On max-k-sums. Math. Program. 171(1-2): 489-517 (2018) - 2016
- [b1]Michael J. Todd:
Minimum volume ellipsoids - theory and algorithms. MOS-SIAM Series on Optimization 23, SIAM 2016, ISBN 978-1-611-97437-9, pp. 1-149 - [j85]Michael J. Todd:
Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers. Math. Oper. Res. 41(3): 1125-1134 (2016) - 2014
- [j84]Michael J. Todd:
An Improved Kalai-Kleitman Bound for the Diameter of a Polyhedron. SIAM J. Discret. Math. 28(4): 1944-1947 (2014) - 2013
- [j83]Selin Damla Ahipasaoglu
A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms. Comput. Geom. 46(5): 494-519 (2013) - [j82]Andrew Philip Bradshaw, David S. Taubman
Augmented Active Surface Model for the Recovery of Small Structures in CT. IEEE Trans. Image Process. 22(11): 4394-4406 (2013) - 2012
- [j81]Martina Gancarova, Michael J. Todd:
A robust robust optimization result. Oper. Res. Lett. 40(1): 2-5 (2012) - 2010
- [i1]Michael J. Todd:
Proportional Response as Iterated Cobb-Douglas. Equilibrium Computation 2010
2000 – 2009
- 2009
- [j80]Michael J. Todd:
Largest dual ellipsoids inscribed in dual cones. Math. Program. 117(1-2): 425-434 (2009) - 2008
- [j79]Michael J. Todd:
Dual versus primal-dual interior-point methods for linear and conic programming. Math. Program. 111(1-2): 301-313 (2008) - [j78]Selin Damla Ahipasaoglu
Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Methods Softw. 23(1): 5-19 (2008) - [c1]Andrew Philip Bradshaw, Michael J. Todd, David S. Taubman
Active surface modeling at CT resolution limits with micro CT ground truth. ICIP 2008: 1081-1084 - 2007
- [j77]Michael J. Todd, E. Alper Yildirim
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids. Discret. Appl. Math. 155(13): 1731-1744 (2007) - 2004
- [r1]Michael J. Todd:
Mathematical programming. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1015-1036 - 2003
- [j76]Ronald A. DeVore, Arieh Iserles, Michael J. Todd:
Editorial. Found. Comput. Math. 3(2): 111 (2003) - [j75]Reha H. Tütüncü, Kim-Chuan Toh, Michael J. Todd:
Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95(2): 189-217 (2003) - 2002
- [j74]Yurii E. Nesterov, Michael J. Todd:
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods. Found. Comput. Math. 2(4): 333-361 (2002) - [j73]Michael J. Todd:
The many facets of linear programming. Math. Program. 91(3): 417-436 (2002) - [j72]E. Alper Yildirim
An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs. SIAM J. Optim. 12(3): 692-714 (2002) - 2001
- [j71]Shinji Mizuno, Michael J. Todd:
On two homogeneous self-dual approaches to linear programming and its extensions. Math. Program. 89(3): 517-534 (2001) - [j70]Michael J. Todd, Levent Tunçel, Yinyu Ye:
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems. Math. Program. 90(1): 59-69 (2001) - [j69]E. Alper Yildirim
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods. Math. Program. 90(2): 229-261 (2001) - 2000
- [j68]Michael Wagner
Least-change quasi-Newton updates for equality-constrained optimization. Math. Program. 87(2): 317-350 (2000)
1990 – 1999
- 1999
- [j67]Yurii E. Nesterov, Michael J. Todd, Yinyu Ye:
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Program. 84(2): 227-267 (1999) - 1998
- [j66]Michael J. Todd:
Erratum: Probabilistic Models for Linear Programming. Math. Oper. Res. 23(3): 767-768 (1998) - [j65]Michael J. Todd, Yinyu Ye:
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming. Math. Program. 81: 1-21 (1998) - [j64]Yurii E. Nesterov, Michael J. Todd:
Primal-Dual Interior-Point Methods for Self-Scaled Cones. SIAM J. Optim. 8(2): 324-364 (1998) - [j63]Michael J. Todd, Kim-Chuan Toh, Reha H. Tütüncü:
On the Nesterov-Todd Direction in Semidefinite Programming. SIAM J. Optim. 8(3): 769-796 (1998) - 1997
- [j62]Levent Tunçel, Michael J. Todd:
On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms. Comput. Optim. Appl. 8(1): 5-19 (1997) - [j61]Yurii E. Nesterov, Michael J. Todd:
Self-Scaled Barriers and Interior-Point Methods for Convex Programming. Math. Oper. Res. 22(1): 1-42 (1997) - 1996
- [j60]Michael J. Todd, Yinyu Ye:
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms. Ann. Oper. Res. 62(1): 233-252 (1996) - [j59]Levent Tunçel
Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming. Math. Oper. Res. 21(2): 354-381 (1996) - [j58]Michael J. Todd:
Potential-reduction methods in mathematical programming. Math. Program. 76: 3-45 (1996) - [j57]Aiping Liao, Michael J. Todd:
Solving LP Problems via Weighted Centers. SIAM J. Optim. 6(4): 933-960 (1996) - 1995
- [j56]Shinji Mizuno, Michael J. Todd, Yinyu Ye:
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming. Math. Oper. Res. 20(1): 135-162 (1995) - [j55]Robert M. Freund, Michael J. Todd:
Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables. Math. Oper. Res. 20(2): 415-440 (1995) - [j54]Shinji Mizuno, Masakazu Kojima, Michael J. Todd:
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming. SIAM J. Optim. 5(1): 52-67 (1995) - 1994
- [j53]Michael J. Todd:
Scaling, shifting and weighting in interior-point methods. Comput. Optim. Appl. 3(4): 305-315 (1994) - [j52]Michael J. Todd:
Commentary - Theory and Practice for Interior-Point Methods. INFORMS J. Comput. 6(1): 28-31 (1994) - [j51]Yinyu Ye, Michael J. Todd, Shinji Mizuno:
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm. Math. Oper. Res. 19(1): 53-67 (1994) - [j50]Michael J. Todd:
Interior-point algorithms for semi-infinite programming. Math. Program. 65: 217-245 (1994) - [j49]Shinji Mizuno, Michael J. Todd, Levent Tunçel:
Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms. SIAM J. Optim. 4(3): 613-625 (1994) - 1993
- [j48]Michael J. Todd, Yufei Wang:
On Combined Phase 1-Phase 2 Projective Methods for Linear Programming. Algorithmica 9(1): 64-83 (1993) - [j47]Aiping Liao, Michael J. Todd:
The ellipsoid algorithm using parallel cuts. Comput. Optim. Appl. 2(4): 299-316 (1993) - [j46]Shinji Mizuno, Michael J. Todd, Yinyu Ye:
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming. Math. Oper. Res. 18(4): 964-981 (1993) - [j45]Michael J. Todd:
Combining phase I and phase II in a potential reduction algorithm for linear programming. Math. Program. 59: 133-150 (1993) - [j44]Leonid Khachiyan, Michael J. Todd:
On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Program. 61: 137-159 (1993) - [j43]Michael J. Todd, Levent Tunçel:
A New Triangulation for Simplicial Algorithms. SIAM J. Discret. Math. 6(1): 167-180 (1993) - 1992
- [j42]Michael J. Todd:
On Anstreicher's combined phase I-phase II projective algorithm for linear programming. Math. Program. 55: 1-15 (1992) - [j41]John E. Mitchell, Michael J. Todd:
Solving combinatorial optimization problems using Karmarkar's algorithm. Math. Program. 56: 245-284 (1992) - [j40]Michael J. Todd, Jean-Philippe Vial:
Todd's low-complexity algorithm is a predictor-corrector path-following method. Oper. Res. Lett. 11(4): 199-207 (1992) - [j39]Michael J. Todd:
A Low Complexity Interior-Point Algorithm for Linear Programming. SIAM J. Optim. 2(2): 198-209 (1992) - [j38]Clóvis C. Gonzaga, Michael J. Todd:
An (O√(n) L)-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming. SIAM J. Optim. 2(3): 349-359 (1992) - 1991
- [j37]Michael J. Todd:
Probabilistic Models for Linear Programming. Math. Oper. Res. 16(4): 671-693 (1991) - [j36]Shinji Mizuno, Michael J. Todd:
An O(n3L) adaptive path following algorithm for a linear complementarity problem. Math. Program. 52: 587-595 (1991) - 1990
- [j35]Michael J. Todd:
A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm. Oper. Res. 38(6): 1006-1018 (1990) - [j34]Michael J. Todd, Yinyu Ye:
A Centered Projective Algorithm for Linear Programming. Math. Oper. Res. 15(3): 508-529 (1990) - [j33]Clyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei:
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions. Math. Oper. Res. 15(4): 736-748 (1990) - [j32]Yinyu Ye, Michael J. Todd:
Containing and Shrinking Ellipsoids in the Path-Following Algorithm. Math. Program. 47: 1-9 (1990)
1980 – 1989
- 1988
- [j31]Walter D. Morris Jr., Michael J. Todd:
Symmetry and Positive Definiteness in Oriented Matroids. Eur. J. Comb. 9(2): 121-129 (1988) - [j30]Michael J. Todd:
Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm. Math. Oper. Res. 13(4): 650-659 (1988) - [j29]Michael J. Todd:
Exploiting special structure in Karmarkar's linear programming algorithm. Math. Program. 41(1-3): 97-113 (1988) - 1986
- [j28]Michael J. Todd, Bruce P. Burrell:
An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables. Algorithmica 1(4): 409-424 (1986) - [j27]Michael J. Todd:
From the editor. Math. Program. 35(1): 1-2 (1986) - [j26]Michael J. Todd:
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems. Math. Program. 35(2): 173-192 (1986) - 1985
- [j25]Michael J. Todd:
Linear and quadratic programming in oriented matroids. J. Comb. Theory B 39(2): 105-133 (1985) - [j24]Bruce P. Burrell, Michael J. Todd:
The Ellipsoid Method Generates Dual Variables. Math. Oper. Res. 10(4): 688-700 (1985) - [j23]Michael J. Todd:
'Fat' triangulations, or solving certain nonconvex matrix optimization problems. Math. Program. 31(2): 123-136 (1985) - 1983
- [j22]Samuel A. Awoniyi, Michael J. Todd:
An efficient simplicial algorithm for computing a zero of a convex union of smooth functions. Math. Program. 25(1): 83-108 (1983) - [j21]Michael J. Todd:
Large-scale linear programming: Geometry, working bases and factorizations. Math. Program. 26(1): 1-20 (1983) - 1982
- [j20]Michael J. Todd:
On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid. Math. Oper. Res. 7(2): 253-261 (1982) - [j19]Donald Goldfarb, Michael J. Todd:
Modifications and implementation of the ellipsoid algorithm for linear programming. Math. Program. 23(1): 1-19 (1982) - [j18]Michael J. Todd:
An implementation of the simplex method for linear programming problems with variable upper bounds. Math. Program. 23(1): 34-49 (1982) - [j17]Michael J. Todd:
On the computational complexity of piecewise-linear homotopy algorithms. Math. Program. 24(1): 216-224 (1982) - 1981
- [j16]Robert G. Bland, Donald Goldfarb, Michael J. Todd:
Feature Article - The Ellipsoid Method: A Survey. Oper. Res. 29(6): 1039-1091 (1981) - [j15]Robert M. Freund, Michael J. Todd:
A Constructive Proof of Tucker's Combinatorial Lemma. J. Comb. Theory A 30(3): 321-325 (1981) - [j14]Michael J. Todd:
Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere. Math. Oper. Res. 6(4): 579-592 (1981) - 1980
- [j13]Robert B. Rovinsky, Christine A. Shoemaker, Michael J. Todd:
Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation. Oper. Res. 28(4): 859-866 (1980) - [j12]Michael J. Todd, Robert C. Acar:
A Note on Optimally Dissecting Simplices. Math. Oper. Res. 5(1): 63-66 (1980) - [j11]Michael J. Todd:
Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths. Math. Oper. Res. 5(2): 242-257 (1980) - [j10]Michael J. Todd:
The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4. Math. Oper. Res. 5(4): 599-601 (1980) - [j9]Michael J. Todd:
A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization. Math. Program. 18(1): 111-126 (1980) - [j8]Michael J. Todd:
Exploiting structure in piecewise-linear homotopy algorithms for solving equations. Math. Program. 18(1): 233-247 (1980)
1970 – 1979
- 1979
- [j7]Michael J. Todd:
Piecewise linear paths to minimize convex functions may not be monotonic. Math. Program. 17(1): 106-108 (1979) - 1978
- [j6]Michael J. Todd:
On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm. Math. Oper. Res. 3(2): 126-132 (1978) - [j5]Michael J. Todd:
Bimatrix games - an addendum. Math. Program. 14(1): 112-115 (1978) - 1976
- [j4]Michael J. Todd:
Characterizing binary simplical matroids. Discret. Math. 16(1): 61-70 (1976) - [j3]Michael J. Todd:
Orientation in Complementary Pivot Algorithms. Math. Oper. Res. 1(1): 54-66 (1976) - [j2]Michael J. Todd:
On triangulations for computing fixed points. Math. Program. 10(1): 322-346 (1976) - 1974
- [j1]Michael J. Todd:
A generalized complementary pivoting algorithm. Math. Program. 6(1): 243-263 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: