Michael J. Todd - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 88 from 88

2018

On max-k-sumsMichael J. Todd. mp, 171(1-2):489-517, 2018. [doi]

2016

Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in IntegersMichael J. Todd. mor, 41(3):1125-1134, 2016. [doi]

Minimum volume ellipsoids - theory and algorithmsMichael J. Todd. Volume 23 of MOS-SIAM Series on Optimization, SIAM, 2016.

2014

An Improved Kalai-Kleitman Bound for the Diameter of a PolyhedronMichael J. Todd. siamdm, 28(4):1944-1947, 2014. [doi]

2013

A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithmsS. Damla Ahipasaoglu, Michael J. Todd. comgeo, 46(5):494-519, 2013. [doi]

Augmented Active Surface Model for the Recovery of Small Structures in CTAndrew Philip Bradshaw, David S. Taubman, Michael J. Todd, John S. Magnussen, G. Michael Halmagyi. TIP, 22(11):4394-4406, 2013. [doi]

2012

A robust robust optimization resultMartina Gancarova, Michael J. Todd. orl, 40(1):2-5, 2012. [doi]

2010

Proportional Response as Iterated Cobb-DouglasMichael J. Todd. Dagstuhl 2010: [doi]

2009

Largest dual ellipsoids inscribed in dual conesMichael J. Todd. mp, 117(1-2):425-434, 2009. [doi]

2008

Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoidsS. Damla Ahipasaoglu, Peng Sun, Michael J. Todd. oms, 23(1):5-19, 2008. [doi]

Active surface modeling at CT resolution limits with micro CT ground truthAndrew P. Bradshaw, Michael J. Todd, David S. Taubman. icip 2008: 1081-1084 [doi]

Dual versus primal-dual interior-point methods for linear and conic programmingMichael J. Todd. mp, 111(1-2):301-313, 2008. [doi]

2007

On Khachiyan s algorithm for the computation of minimum-volume enclosing ellipsoidsMichael J. Todd, E. Alper Yildirim. DAM, 155(13):1731-1744, 2007. [doi]

2003

EditorialRonald A. DeVore, Arieh Iserles, Michael J. Todd. focm, 3(2):111, 2003. [doi]

Solving semidefinite-quadratic-linear programs using SDPT3Reha H. Tütüncü, K. C. Toh, Michael J. Todd. mp, 95(2):189-217, 2003. [doi]

2002

On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point MethodsYu. E. Nesterov, Michael J. Todd. focm, 2(4):333-361, 2002. [doi]

The many facets of linear programmingMichael J. Todd. mp, 91(3):417-436, 2002. [doi]

An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear ProgramsE. Alper Yildirim, Michael J. Todd. siamjo, 12(3):692-714, 2002. [doi]

2001

On two homogeneous self-dual approaches to linear programming and its extensionsShinji Mizuno, Michael J. Todd. mp, 89(3):517-534, 2001. [doi]

Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problemsMichael J. Todd, Levent Tunçel, Yinyu Ye. mp, 90(1):59-69, 2001. [doi]

Sensitivity analysis in linear programming and semidefinite programming using interior-point methodsE. Alper Yildirim, Michael J. Todd. mp, 90(2):229-261, 2001. [doi]

2000

Least-change quasi-Newton updates for equality-constrained optimizationMichael Wagner, Michael J. Todd. mp, 87(2):317-350, 2000. [doi]

1999

Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problemsYu. E. Nesterov, Michael J. Todd, Yinyu Ye. mp, 84(2):227-267, 1999. [doi]

1998

Primal-Dual Interior-Point Methods for Self-Scaled ConesYurii E. Nesterov, Michael J. Todd. siamjo, 8(2):324-364, 1998. [doi]

Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programmingMichael J. Todd, Yinyu Ye. mp, 81:1-21, 1998.

Erratum: Probabilistic Models for Linear ProgrammingMichael J. Todd. mor, 23(3):767-768, 1998. [doi]

On the Nesterov-Todd Direction in Semidefinite ProgrammingMichael J. Todd, Kim-Chuan Toh, Reha H. Tütüncü. siamjo, 8(3):769-796, 1998. [doi]

1997

Self-Scaled Barriers and Interior-Point Methods for Convex ProgrammingYurii E. Nesterov, Michael J. Todd. mor, 22(1):1-42, 1997. [doi]

On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point AlgorithmsLevent Tunçel, Michael J. Todd. coap, 8(1):5-19, 1997. [doi]

1996

Solving LP Problems via Weighted CentersAiping Liao, Michael J. Todd. siamjo, 6(4):933-960, 1996. [doi]

Potential-reduction methods in mathematical programmingMichael J. Todd. mp, 76:3-45, 1996.

A lower bound on the number of iterations of long-step primal-dual linear programming algorithmsMichael J. Todd, Yinyu Ye. anor, 62(1):233-252, 1996. [doi]

Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite ProgrammingLevent Tunçel, Michael J. Todd. mor, 21(2):354-381, 1996. [doi]

1995

Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the VariablesRobert M. Freund, Michael J. Todd. mor, 20(2):415-440, 1995. [doi]

Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear ProgrammingShinji Mizuno, Masakazu Kojima, Michael J. Todd. siamjo, 5(1):52-67, 1995. [doi]

A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear ProgrammingShinji Mizuno, Michael J. Todd, Yinyu Ye. mor, 20(1):135-162, 1995. [doi]

1994

Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point AlgorithmsShinji Mizuno, Michael J. Todd, Levent Tunçel. siamjo, 4(3):613-625, 1994. [doi]

Interior-point algorithms for semi-infinite programmingMichael J. Todd. mp, 65:217-245, 1994.

Commentary - Theory and Practice for Interior-Point MethodsMichael J. Todd. informs, 6(1):28-31, 1994. [doi]

Scaling, shifting and weighting in interior-point methodsMichael J. Todd. coap, 3(4):305-315, 1994. [doi]

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming AlgorithmYinyu Ye, Michael J. Todd, Shinji Mizuno. mor, 19(1):53-67, 1994. [doi]

1993

On the complexity of approximating the maximal inscribed ellipsoid for a polytopeLeonid Khachiyan, Michael J. Todd. mp, 61:137-159, 1993.

The ellipsoid algorithm using parallel cutsAiping Liao, Michael J. Todd. coap, 2(4):299-316, 1993. [doi]

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear ProgrammingShinji Mizuno, Michael J. Todd, Yinyu Ye. mor, 18(4):964-981, 1993. [doi]

Combining phase I and phase II in a potential reduction algorithm for linear programmingMichael J. Todd. mp, 59:133-150, 1993.

A New Triangulation for Simplicial AlgorithmsMichael J. Todd, Levent Tunçel. siamdm, 6(1):167-180, 1993.

On Combined Phase 1-Phase 2 Projective Methods for Linear ProgrammingMichael J. Todd, Yufei Wang. algorithmica, 9(1):64-83, 1993.

1992

An (O√(n) L)-Iteration Large-Step Primal-Dual Affine Algorithm for Linear ProgrammingClóvis C. Gonzaga, Michael J. Todd. siamjo, 2(3):349-359, 1992. [doi]

Solving combinatorial optimization problems using Karmarkar s algorithmJohn E. Mitchell, Michael J. Todd. mp, 56:245-284, 1992.

On Anstreicher s combined phase I-phase II projective algorithm for linear programmingMichael J. Todd. mp, 55:1-15, 1992.

A Low Complexity Interior-Point Algorithm for Linear ProgrammingMichael J. Todd. siamjo, 2(2):198-209, 1992. [doi]

1991

An O(n:::3:::L) adaptive path following algorithm for a linear complementarity problemShinji Mizuno, Michael J. Todd. mp, 52:587-595, 1991.

Probabilistic Models for Linear ProgrammingMichael J. Todd. mor, 16(4):671-693, 1991. [doi]

1990

1988

Symmetry and Positive Definiteness in Oriented MatroidsWalter D. Morris Jr., Michael J. Todd. ejc, 9(2):121-129, 1988. [doi]

Exploiting special structure in Karmarkar's linear programming algorithmMichael J. Todd. mp, 41(1-3):97-113, 1988. [doi]

Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming AlgorithmMichael J. Todd. mor, 13(4):650-659, 1988. [doi]

1986

An Extension of Karmarkar s Algorithm for Linear Programming Using Dual VariablesMichael J. Todd, Bruce P. Burrell. algorithmica, 1(4):409-424, 1986.

From the editorMichael J. Todd. mp, 35(1):1-2, 1986. [doi]

Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problemsMichael J. Todd. mp, 35(2):173-192, 1986. [doi]

1985

The Ellipsoid Method Generates Dual VariablesBruce P. Burrell, Michael J. Todd. mor, 10(4):688-700, 1985. [doi]

Linear and quadratic programming in oriented matroidsMichael J. Todd. JCT, 39(2):105-133, 1985. [doi]

'Fat' triangulations, or solving certain nonconvex matrix optimization problemsMichael J. Todd. mp, 31(2):123-136, 1985. [doi]

1983

An efficient simplicial algorithm for computing a zero of a convex union of smooth functionsSamuel A. Awoniyi, Michael J. Todd. mp, 25(1):83-108, 1983. [doi]

Large-scale linear programming: Geometry, working bases and factorizationsMichael J. Todd. mp, 26(1):1-20, 1983. [doi]

1982

Modifications and implementation of the ellipsoid algorithm for linear programmingDonald Goldfarb, Michael J. Todd. mp, 23(1):1-19, 1982. [doi]

An implementation of the simplex method for linear programming problems with variable upper boundsMichael J. Todd. mp, 23(1):34-49, 1982. [doi]

On the computational complexity of piecewise-linear homotopy algorithmsMichael J. Todd. mp, 24(1):216-224, 1982. [doi]

On Minimum Volume Ellipsoids Containing Part of a Given EllipsoidMichael J. Todd. mor, 7(2):253-261, 1982. [doi]

1981

Feature Article - The Ellipsoid Method: A SurveyRobert G. Bland, Donald Goldfarb, Michael J. Todd. ior, 29(6):1039-1091, 1981. [doi]

A Constructive Proof of Tucker s Combinatorial LemmaRobert M. Freund, Michael J. Todd. JCT, 30(3):321-325, 1981.

Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the SphereMichael J. Todd. mor, 6(4):579-592, 1981. [doi]

1980

Determining Optimal Use of Resources among Regional Producers under Differing Levels of CooperationRobert B. Rovinsky, Christine A. Shoemaker, Michael J. Todd. ior, 28(4):859-866, 1980. [doi]

A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimizationMichael J. Todd. mp, 18(1):111-126, 1980. [doi]

Exploiting structure in piecewise-linear homotopy algorithms for solving equationsMichael J. Todd. mp, 18(1):233-247, 1980. [doi]

Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear PathsMichael J. Todd. mor, 5(2):242-257, 1980. [doi]

A Note on Optimally Dissecting SimplicesMichael J. Todd, Robert C. Acar. mor, 5(1):63-66, 1980. [doi]

The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4Michael J. Todd. mor, 5(4):599-601, 1980. [doi]

1979

Piecewise linear paths to minimize convex functions may not be monotonicMichael J. Todd. mp, 17(1):106-108, 1979. [doi]

1978

Bimatrix games - an addendumMichael J. Todd. mp, 14(1):112-115, 1978. [doi]

On the Jacobian of a Function at a Zero Computed by a Fixed Point AlgorithmMichael J. Todd. mor, 3(2):126-132, 1978. [doi]

1976

On triangulations for computing fixed pointsMichael J. Todd. mp, 10(1):322-346, 1976. [doi]

Orientation in Complementary Pivot AlgorithmsMichael J. Todd. mor, 1(1):54-66, 1976. [doi]

Characterizing binary simplical matroidsMichael J. Todd. DM, 16(1):61-70, 1976. [doi]

1974

A generalized complementary pivoting algorithmMichael J. Todd. mp, 6(1):243-263, 1974. [doi]

Sign in or sign up to see more results.

runs on WebDSL