IDEAS home Printed from https://ideas.repec.org/e/pto35.html
   My authors  Follow this author

Michael Todd

Personal Details

First Name:Michael
Middle Name:
Last Name:Todd
Suffix:
RePEc Short-ID:pto35
http://people.orie.cornell.edu/~miketodd/todd.html

Affiliation

Cornell University, School of Operations Research and Industrial Engineering

http://www.orie.cornell.edu
US, Ithaca

Research output

as
Jump to: Working papers Articles

Working papers

  1. M.J. Todd & A. Fostel & H.E. Scarf, 2004. "Two New Proofs of Afriat's Theorem," Econometric Society 2004 North American Summer Meetings 632, Econometric Society.
  2. NESTEROV, Yurii & TODD, Michael & YE, Ping-Yuan, 1996. "Primal-Dual Methods and Infeasibility Detectors for Nonlinear Programming Problems," CORE Discussion Papers 1996037, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  3. NESTEROV , Yurii & TODD , Michael, 1995. "Primal-Dual Interior-Point Methods for Self-Scaled Cones," CORE Discussion Papers 1995044, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  4. NESTEROV ., Yurii E. & TODD , Michael J, 1994. "Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming," CORE Discussion Papers 1994062, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  5. Freund, Robert Michael. & Todd, Michael J., 1947-, 1992. "Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables," Working papers 3454-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
  6. Michael J. Todd & Yinyu Ye, 1988. "A Centered Projective Algorithm for Linear Programming," Cowles Foundation Discussion Papers 861, Cowles Foundation for Research in Economics, Yale University.
  7. Freund, Robert Michael. & Roundy, Robin. & Todd, Michael J., 1947-, 1985. "Identifying the set of always-active constraints in a system of linear inequalities by a single linear program," Working papers 1674-85., Massachusetts Institute of Technology (MIT), Sloan School of Management.
  8. TODD, Michael J., 1978. "Solving the generalized market area problem," CORE Discussion Papers RP 349, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  9. TODD, Michael J., 1978. "On the Jacobian of a function at a zero computed by a fixed point algorithm," CORE Discussion Papers RP 338, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  10. R. Saigal & M.J. Todd, 1976. "Efficient Acceleration Techniques for Fixed Point Algorithms," Discussion Papers 261, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

Articles

  1. Michael J. Todd, 2016. "Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 1125-1134, August.
  2. Qiao, Xingye & Zhang, Hao Helen & Liu, Yufeng & Todd, Michael J. & Marron, J. S., 2010. "Weighted Distance Weighted Discrimination and Its Asymptotic Properties," Journal of the American Statistical Association, American Statistical Association, vol. 105(489), pages 401-414.
  3. Marron, J.S. & Todd, Michael J. & Ahn, Jeongyoun, 2007. "Distance-Weighted Discrimination," Journal of the American Statistical Association, American Statistical Association, vol. 102, pages 1267-1271, December.
  4. A. Fostel & H. Scarf & M. Todd, 2004. "Two new proofs of Afriat’s theorem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 24(1), pages 211-219, July.
  5. M. J. Todd, 1998. "Erratum: Probabilistic Models for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 767-768, August.
  6. Yu. E. Nesterov & M. J. Todd, 1997. "Self-Scaled Barriers and Interior-Point Methods for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 1-42, February.
  7. Levent Tunçel & Michael J. Todd, 1996. "Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming," Mathematics of Operations Research, INFORMS, vol. 21(2), pages 354-381, May.
  8. Shinji Mizuno & Michael J. Todd & Yinyu Ye, 1995. "A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 20(1), pages 135-162, February.
  9. Robert M. Freund & Michael J. Todd, 1995. "Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables," Mathematics of Operations Research, INFORMS, vol. 20(2), pages 415-440, May.
  10. Yinyu Ye & Michael J. Todd & Shinji Mizuno, 1994. "An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm," Mathematics of Operations Research, INFORMS, vol. 19(1), pages 53-67, February.
  11. Michael J. Todd, 1994. "Commentary—Theory and Practice for Interior-Point Methods," INFORMS Journal on Computing, INFORMS, vol. 6(1), pages 28-31, February.
  12. Shinji Mizuno & Michael J. Todd & Yinyu Ye, 1993. "On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 964-981, November.
  13. Michael J. Todd, 1991. "Probabilistic Models for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 16(4), pages 671-693, November.
  14. Michael J. Todd, 1990. "A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm," Operations Research, INFORMS, vol. 38(6), pages 1006-1018, December.
  15. Michael J. Todd & Yinyu Ye, 1990. "A Centered Projective Algorithm for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 508-529, August.
  16. Clyde L. Monma & Alexander Schrijver & Michael J. Todd & Victor K. Wei, 1990. "Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions," Mathematics of Operations Research, INFORMS, vol. 15(4), pages 736-748, November.
  17. Michael J. Todd, 1988. "Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm," Mathematics of Operations Research, INFORMS, vol. 13(4), pages 650-659, November.
  18. Bruce P. Burrell & Michael J. Todd, 1985. "The Ellipsoid Method Generates Dual Variables," Mathematics of Operations Research, INFORMS, vol. 10(4), pages 688-700, November.
  19. Michael J. Todd, 1982. "On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid," Mathematics of Operations Research, INFORMS, vol. 7(2), pages 253-261, May.
  20. Michael J. Todd, 1981. "Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere," Mathematics of Operations Research, INFORMS, vol. 6(4), pages 579-592, November.
  21. Robert G. Bland & Donald Goldfarb & Michael J. Todd, 1981. "Feature Article—The Ellipsoid Method: A Survey," Operations Research, INFORMS, vol. 29(6), pages 1039-1091, December.
  22. Robert B. Rovinsky & Christine A. Shoemaker & Michael J. Todd, 1980. "Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation," Operations Research, INFORMS, vol. 28(4), pages 859-866, August.
  23. Michael J. Todd, 1980. "The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4," Mathematics of Operations Research, INFORMS, vol. 5(4), pages 599-601, November.
  24. Michael J. Todd & Robert C. Acar, 1980. "A Note on Optimally Dissecting Simplices," Mathematics of Operations Research, INFORMS, vol. 5(1), pages 63-66, February.
  25. Michael J. Todd, 1980. "Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths," Mathematics of Operations Research, INFORMS, vol. 5(2), pages 242-257, May.
  26. Todd, Michael J., 1979. "A note on computing equilibria in economies with activity analysis models of production," Journal of Mathematical Economics, Elsevier, vol. 6(2), pages 135-144, July.
  27. Michael J. Todd, 1978. "On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm," Mathematics of Operations Research, INFORMS, vol. 3(2), pages 126-132, May.
  28. Michael J. Todd, 1978. "Note--Solving the Generalized Market Area Problem," Management Science, INFORMS, vol. 24(14), pages 1549-1554, October.
  29. Michael J. Todd, 1976. "Orientation in Complementary Pivot Algorithms," Mathematics of Operations Research, INFORMS, vol. 1(1), pages 54-66, February.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. M.J. Todd & A. Fostel & H.E. Scarf, 2004. "Two New Proofs of Afriat's Theorem," Econometric Society 2004 North American Summer Meetings 632, Econometric Society.

    Cited by:

    1. John Quah, 2014. "A test for weakly separable preferences," Economics Series Working Papers 708, University of Oxford, Department of Economics.
    2. Laurens Cherchye & Bram De Rock & Vincenzo Platino, 2013. "Private versus public consumption within groups: testing the nature of goods from aggregate data," ULB Institutional Repository 2013/131703, ULB -- Universite Libre de Bruxelles.
    3. D. Wade Hands, 2014. "Paul Samuelson and Revealed Preference Theory," History of Political Economy, Duke University Press, vol. 46(1), pages 85-116, Spring.
    4. Teo Chung Piaw & Rakesh V. Vohra, 2003. "Afrait's Theorem and Negative Cycles," Discussion Papers 1377, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    5. Matthew Polisson & Ludovic Renou, 2016. "Afriat's Theorem and Samuelson's `Eternal Darkness'," Discussion Papers in Economics 16/09, Department of Economics, University of Leicester.
    6. Alfred Galichon & John Quah, 2013. "Symposium on revealed preference analysis," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(3), pages 419-423, November.
    7. Santiago Sanchez-Pages, 2012. "(Don't) Make My Vote Count," ESE Discussion Papers 213, Edinburgh School of Economics, University of Edinburgh.
    8. Forges, Françoise & Iehlé, Vincent, 2014. "Afriat’s theorem for indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 1-6.
    9. John Geanakoplos, 2013. "Afriat from MaxMin," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(3), pages 443-448, November.
    10. Matthew Polisson, 2012. "Goods versus characteristics: dimension reduction and revealed preference," IFS Working Papers W12/02, Institute for Fiscal Studies.
    11. Ivar Ekeland & Alfred Galichon, 2013. "The Housing Problem and Revealed Preference Theory: Duality and an application," Post-Print hal-01059558, HAL.
    12. Victor H. Aguiar & Roberto Serrano, 2018. "Cardinal Revealed Preference, Price-Dependent Utility, and Consistent Binary Choice," Working Papers 2018-3, Brown University, Department of Economics.
    13. Apartsin, Yevgenia & Kannai, Yakar, 2006. "Demand properties of concavifiable preferences," Journal of Mathematical Economics, Elsevier, vol. 43(1), pages 36-55, December.
    14. Matthew Polisson & John K.-H. Quah, 2013. "Revealed Preference in a Discrete Consumption Space," American Economic Journal: Microeconomics, American Economic Association, vol. 5(1), pages 28-34, February.
    15. Laurens Cherchye & Thomas Demuynck & Bram De Rock, 2012. "Revealed Preference Analysis for Convex Rationalizations on Nonlinear Budget Sets," Working Papers ECARES ECARES 2012-044, ULB -- Universite Libre de Bruxelles.
    16. Leeat Yariv & David Laibson, 2004. "Safety in Markets: An Impossibility Theorem for Dutch Books," 2004 Meeting Papers 867, Society for Economic Dynamics.
    17. Forges, Françoise & Iehlé, Vincent, 2012. "Essential Data, Budget Sets and Rationalization," MPRA Paper 36519, University Library of Munich, Germany.
    18. Francoise Forges & Enrico Minelli, 2006. "Afriat's Theorem for General Budget Sets," Working Papers ubs0609, University of Brescia, Department of Economics.
    19. Sákovics, József, 2012. "Revealed cardinal preference," SIRE Discussion Papers 2012-02, Scottish Institute for Research in Economics (SIRE).
    20. Halevy, Yoram & Persitz, Dotan & Zrill, Lanny, 2017. "Non-parametric bounds for non-convex preferences," Journal of Economic Behavior & Organization, Elsevier, vol. 137(C), pages 105-112.
    21. Thomas Demuynck & Christian Seel, 2018. "Revealed Preference with Limited Consideration," American Economic Journal: Microeconomics, American Economic Association, vol. 10(1), pages 102-131, February.
    22. Echenique, Federico & Galichon, Alfred, 2017. "Ordinal and cardinal solution concepts for two-sided matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 63-77.
    23. Pawel Dziewulski, 2018. "Just-noticeable difference as a behavioural foundation of the critical cost-efficiency," Economics Series Working Papers 848, University of Oxford, Department of Economics.
    24. Hiroki Nishimura & Efe A. Ok & John K.-H. Quah, 2014. "A Unified Approach to Revealed Preference Theory: The Case of Rational Choice," Working Papers 201418, University of California at Riverside, Department of Economics.
    25. Sam Cosaert & Thomas Demuynck, 2015. "Revealed preference theory for finite choice sets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 59(1), pages 169-200, May.
    26. Kohei Shiozawa, 2015. "Revealed Preference Test and Shortest Path Problem; Graph Theoretic Structure of the Rationalizability Test," Discussion Papers in Economics and Business 15-17-Rev.2, Osaka University, Graduate School of Economics and Osaka School of International Public Policy (OSIPP), revised Aug 2016.
    27. Halevy, Yoram & Persitz, Dotan & Zrill, Lanny, 2012. "Parametric Recoverability of Preferences," Microeconomics.ca working papers yoram_halevy-2012-20, Vancouver School of Economics, revised 28 Aug 2015.
    28. Kohei Shiozawa, 2015. "Revealed Preference Test and Shortest Path Problem; Graph Theoretic Structure of the Rationalizability Test," Discussion Papers in Economics and Business 15-17, Osaka University, Graduate School of Economics and Osaka School of International Public Policy (OSIPP).
    29. Anat Bracha, 2004. "Consistency and Refutability of Affective Choice," Yale School of Management Working Papers amz2639, Yale School of Management.
    30. Andrés Carvajal & Rahul Deb & James Fenske & John Quah, 2014. "A nonparametric analysis of multi-product oligopolies," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 57(2), pages 253-277, October.
    31. John Geanakoplos, 2013. "Afriat from MaxMin," Cowles Foundation Discussion Papers 1904, Cowles Foundation for Research in Economics, Yale University.
    32. Leeat Yariv, 2004. "Safety in Markets: An Impossibility Theorem for Dutch Books," Theory workshop papers 658612000000000072, UCLA Department of Economics.
    33. Matthew Polisson & John K.-H. Quah, 2013. "Revealed preference tests under risk and uncertainty," Discussion Papers in Economics 13/24, Department of Economics, University of Leicester.
    34. Green, Jerry & Hojman, Daniel, 2007. "Choice, Rationality and Welfare Measurement," Working Paper Series rwp07-054, Harvard University, John F. Kennedy School of Government.
    35. Per Hjertstrand & James Swofford, 2012. "Revealed preference tests for consistency with weakly separable indirect utility," Theory and Decision, Springer, vol. 72(2), pages 245-256, February.
    36. Shiozawa, Kohei, 2016. "Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test," Journal of Mathematical Economics, Elsevier, vol. 67(C), pages 38-48.
    37. John Quah, 2012. "A revealed preference test for weakly separable preferences," Economics Series Working Papers 601, University of Oxford, Department of Economics.
    38. Matthew Polisson, 2011. "Goods Versus Characteristics: Revealed Preference Procedures for Nested Models," Economics Series Working Papers 531, University of Oxford, Department of Economics.
    39. John Geanakoplos, 2013. "Afriat from MaxMin," Levine's Working Paper Archive 786969000000000746, David K. Levine.
    40. Kohei Shiozawa, 2015. "Revealed Preference Test and Shortest Path Problem; Graph Theoretic Structure of the Rationalizability Test," Discussion Papers in Economics and Business 15-17-Rev., Osaka University, Graduate School of Economics and Osaka School of International Public Policy (OSIPP), revised Jul 2015.
    41. Satoru Fujishige & Zaifu Yang, 2012. "On Revealed Preference and Indivisibilities," Discussion Papers 12/02, Department of Economics, University of York.
    42. Christopher Chambers & Federico Echenique, 2009. "Profit maximization and supermodular technology," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 40(2), pages 173-183, August.
    43. Lee, Chia-Yen & Johnson, Andrew L. & Moreno-Centeno, Erick & Kuosmanen, Timo, 2013. "A more efficient algorithm for Convex Nonparametric Least Squares," European Journal of Operational Research, Elsevier, vol. 227(2), pages 391-400.
    44. Kolesnikov, Alexander V. & Kudryavtseva, Olga V. & Nagapetyan, Tigran, 2013. "Remarks on Afriat’s theorem and the Monge–Kantorovich problem," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 501-505.

  2. NESTEROV, Yurii & TODD, Michael & YE, Ping-Yuan, 1996. "Primal-Dual Methods and Infeasibility Detectors for Nonlinear Programming Problems," CORE Discussion Papers 1996037, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1998. "Conic convex programming and self-dual embedding," Econometric Institute Research Papers EI 9815, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Liqun Qi & Yinyu Ye, 2014. "Space tensor conic programming," Computational Optimization and Applications, Springer, vol. 59(1), pages 307-319, October.
    3. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1997. "Duality Results for Conic Convex Programming," Econometric Institute Research Papers EI 9719/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

  3. NESTEROV , Yurii & TODD , Michael, 1995. "Primal-Dual Interior-Point Methods for Self-Scaled Cones," CORE Discussion Papers 1995044, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Li Yang & Bo Yu, 2013. "A homotopy method for nonlinear semidefinite programming," Computational Optimization and Applications, Springer, vol. 56(1), pages 81-96, September.
    2. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1996. "Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming," Econometric Institute Research Papers 9607/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. F. A. Potra & R. Sheng, 1998. "Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 99(1), pages 103-119, October.
    4. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Discussion Paper 2002-73, Tilburg University, Center for Economic Research.
    5. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1998. "Conic convex programming and self-dual embedding," Econometric Institute Research Papers EI 9815, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Alemseged Weldeyesus & Mathias Stolpe, 2015. "A primal-dual interior point method for large-scale free material optimization," Computational Optimization and Applications, Springer, vol. 61(2), pages 409-435, June.
    7. NESTEROV, Yu., 2006. "Nonsymmetric potential-reduction methods for general cones," CORE Discussion Papers 2006034, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Berkelaar, A.B. & Sturm, J.F. & Zhang, S., 1996. "Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming," Econometric Institute Research Papers EI 9667-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. A. D'Aspremont, 2003. "Interest rate model calibration using semidefinite Programming," Applied Mathematical Finance, Taylor & Francis Journals, vol. 10(3), pages 183-213.
    10. de Klerk, E. & Peng, J. & Roos, C. & Terlaky, T., 2001. "A scaled Gauss-Newton primal-dual search direction for semidefinite optimization," Other publications TiSEM 9d85401c-e9d8-45ee-be2d-2, Tilburg University, School of Economics and Management.
    11. Ali Mohammad-Nezhad & Tamás Terlaky, 2017. "A polynomial primal-dual affine scaling algorithm for symmetric conic optimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 577-600, April.
    12. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Discussion Paper 2001-27, Tilburg University, Center for Economic Research.
    13. Arjan B. Berkelaar & Jos F. Sturm & Shuzhong Zhang, 1997. "Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming," Tinbergen Institute Discussion Papers 97-025/4, Tinbergen Institute.
    14. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1997. "Duality Results for Conic Convex Programming," Econometric Institute Research Papers EI 9719/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Gu, G. & Zangiabadi, M. & Roos, C., 2011. "Full Nesterov-Todd step infeasible interior-point method for symmetric optimization," European Journal of Operational Research, Elsevier, vol. 214(3), pages 473-484, November.
    16. NESTEROV, Yu., 2006. "Towards nonsymmetric conic optimization," CORE Discussion Papers 2006028, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

  4. NESTEROV ., Yurii E. & TODD , Michael J, 1994. "Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming," CORE Discussion Papers 1994062, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Discussion Paper 2002-73, Tilburg University, Center for Economic Research.
    2. Alemseged Weldeyesus & Mathias Stolpe, 2015. "A primal-dual interior point method for large-scale free material optimization," Computational Optimization and Applications, Springer, vol. 61(2), pages 409-435, June.
    3. Berkelaar, A.B. & Sturm, J.F. & Zhang, S., 1996. "Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming," Econometric Institute Research Papers EI 9667-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. NESTEROV, Yu., 2006. "Constructing self-concordant barriers for convex cones," CORE Discussion Papers 2006030, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Ali Mohammad-Nezhad & Tamás Terlaky, 2017. "A polynomial primal-dual affine scaling algorithm for symmetric conic optimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 577-600, April.
    6. Maziar Salahi & Renata Sotirov & Tamás Terlaky, 2004. "On self-regular IPMs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(2), pages 209-275, December.
    7. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Discussion Paper 2001-27, Tilburg University, Center for Economic Research.
    8. Arjan B. Berkelaar & Jos F. Sturm & Shuzhong Zhang, 1997. "Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming," Tinbergen Institute Discussion Papers 97-025/4, Tinbergen Institute.
    9. J.F. Sturm & S. Zhang, 1998. "On Sensitivity of Central Solutions in Semidefinite Programming," Tinbergen Institute Discussion Papers 98-040/4, Tinbergen Institute.
    10. NESTEROV, Yu., 2006. "Towards nonsymmetric conic optimization," CORE Discussion Papers 2006028, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

  5. Freund, Robert Michael. & Todd, Michael J., 1947-, 1992. "Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables," Working papers 3454-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    Cited by:

    1. Ordónez, Fernando & Freund, Robert M., 2003. "Computational Experience and the Explanatory Value of Condition Numbers for Linear Optimization," Working papers 4337-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.

  6. Michael J. Todd & Yinyu Ye, 1988. "A Centered Projective Algorithm for Linear Programming," Cowles Foundation Discussion Papers 861, Cowles Foundation for Research in Economics, Yale University.

    Cited by:

    1. Freund, Robert Michael., 1989. "A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start"," Working papers 3079-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Bertsimas, Dimitris. & Luo, Xiaodong., 1993. "On the worst case complexity of potential reduction algorithms for linear programming," Working papers 3558-93., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. S. Cafieri & M. D’Apuzzo & V. Simone & D. Serafino & G. Toraldo, 2007. "Convergence Analysis of an Inexact Potential Reduction Method for Convex Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 355-366, December.
    4. S. Cafieri & M. D’Apuzzo & M. Marino & A. Mucherino & G. Toraldo, 2006. "Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 55-75, April.

  7. Freund, Robert Michael. & Roundy, Robin. & Todd, Michael J., 1947-, 1985. "Identifying the set of always-active constraints in a system of linear inequalities by a single linear program," Working papers 1674-85., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    Cited by:

    1. Toubia, Olivier & Simester, Duncan & Hauser, John & Dahan, Ely, 2003. "Fast Polyhedral Adaptive Conjoint Estimation," Working papers 4279-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Gelareh, Shahin & Neamatian Monemi, Rahimeh & Nickel, Stefan, 2015. "Multi-period hub location problems in transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 67-94.

  8. R. Saigal & M.J. Todd, 1976. "Efficient Acceleration Techniques for Fixed Point Algorithms," Discussion Papers 261, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    Cited by:

    1. R. Saigal, 1977. "On Piecewise Linear Approximations to Smooth Mappings," Discussion Papers 311, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

Articles

  1. Michael J. Todd, 2016. "Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 1125-1134, August.

    Cited by:

    1. Sen, Debapriya, 2018. "Potential games, path independence and Poisson's binomial distribution," MPRA Paper 84409, University Library of Munich, Germany.

  2. Qiao, Xingye & Zhang, Hao Helen & Liu, Yufeng & Todd, Michael J. & Marron, J. S., 2010. "Weighted Distance Weighted Discrimination and Its Asymptotic Properties," Journal of the American Statistical Association, American Statistical Association, vol. 105(489), pages 401-414.

    Cited by:

    1. Jung, Sungkyu & Sen, Arusharka & Marron, J.S., 2012. "Boundary behavior in High Dimension, Low Sample Size asymptotics of PCA," Journal of Multivariate Analysis, Elsevier, vol. 109(C), pages 190-203.
    2. Bolivar-Cime, A. & Marron, J.S., 2013. "Comparison of binary discrimination methods for high dimension low sample size data," Journal of Multivariate Analysis, Elsevier, vol. 115(C), pages 108-121.
    3. Sungkyu Jung & Xingye Qiao, 2014. "A statistical approach to set classification by feature selection with applications to classification of histopathology images," Biometrics, The International Biometric Society, vol. 70(3), pages 536-545, September.
    4. Anil K. Ghosh & Munmun Biswas, 2016. "Distribution-free high-dimensional two-sample tests based on discriminating hyperplanes," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 525-547, September.
    5. Lee, Myung Hee, 2012. "On the border of extreme and mild spiked models in the HDLSS framework," Journal of Multivariate Analysis, Elsevier, vol. 107(C), pages 162-168.
    6. Borysov, Petro & Hannig, Jan & Marron, J.S., 2014. "Asymptotics of hierarchical clustering for growing dimension," Journal of Multivariate Analysis, Elsevier, vol. 124(C), pages 465-479.

  3. Marron, J.S. & Todd, Michael J. & Ahn, Jeongyoun, 2007. "Distance-Weighted Discrimination," Journal of the American Statistical Association, American Statistical Association, vol. 102, pages 1267-1271, December.

    Cited by:

    1. Makoto Aoshima & Kazuyoshi Yata, 2014. "A distance-based, misclassification rate adjusted classifier for multiclass, high-dimensional data," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 66(5), pages 983-1010, October.
    2. Sungkyu Jung & Xingye Qiao, 2014. "A statistical approach to set classification by feature selection with applications to classification of histopathology images," Biometrics, The International Biometric Society, vol. 70(3), pages 536-545, September.
    3. Marron, J.S., 2017. "Big Data in context and robustness against heterogeneity," Econometrics and Statistics, Elsevier, vol. 2(C), pages 73-80.
    4. Anil K. Ghosh & Munmun Biswas, 2016. "Distribution-free high-dimensional two-sample tests based on discriminating hyperplanes," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 525-547, September.
    5. Niladri Roy Chowdhury & Dianne Cook & Heike Hofmann & Mahbubul Majumder & Eun-Kyung Lee & Amy Toth, 2015. "Using visual statistical inference to better understand random class separations in high dimension, low sample size data," Computational Statistics, Springer, vol. 30(2), pages 293-316, June.
    6. Peña Sánchez de Rivera, Daniel & Lillo Rodríguez, Rosa Elvira & Giuliodori, Andrea, 2009. "Clustering and classifying images with local and global variability," DES - Working Papers. Statistics and Econometrics. WS ws090101, Universidad Carlos III de Madrid. Departamento de Estadística.

  4. A. Fostel & H. Scarf & M. Todd, 2004. "Two new proofs of Afriat’s theorem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 24(1), pages 211-219, July.
    See citations under working paper version above.
  5. Yu. E. Nesterov & M. J. Todd, 1997. "Self-Scaled Barriers and Interior-Point Methods for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 1-42, February.

    Cited by:

    1. M. Sayadi Shahraki & H. Mansouri & M. Zangiabadi, 2017. "Two wide neighborhood interior-point methods for symmetric cone optimization," Computational Optimization and Applications, Springer, vol. 68(1), pages 29-55, September.
    2. Chee-Khian Sim, 2011. "Asymptotic Behavior of Underlying NT Paths in Interior Point Methods for Monotone Semidefinite Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 148(1), pages 79-106, January.
    3. Sungwoo Park & Dianne P. O’Leary, 2015. "A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 558-571, August.
    4. Baha Alzalg, 2014. "Homogeneous Self-dual Algorithms for Stochastic Second-Order Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 163(1), pages 148-164, October.
    5. Behrouz Kheirfam, 2015. "A Corrector–Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 246-260, January.
    6. Héctor Ramírez & David Sossa, 2017. "On the Central Paths in Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 649-668, February.
    7. J. Peng & C. Roos & T. Terlaky, 2001. "New Complexity Analysis of the Primal–Dual Method for Semidefinite Optimization Based on the Nesterov–Todd Direction," Journal of Optimization Theory and Applications, Springer, vol. 109(2), pages 327-343, May.
    8. G. Q. Wang & Y. Q. Bai, 2012. "A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 739-772, March.
    9. Ximei Yang & Hongwei Liu & Yinkui Zhang, 2015. "A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 572-587, August.
    10. Xinfu Liu & Zuojun Shen, 2016. "Rapid Smooth Entry Trajectory Planning for High Lift/Drag Hypersonic Glide Vehicles," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 917-943, March.
    11. Changhe Liu & Hongwei Liu & Xinze Liu, 2012. "Polynomial Convergence of Second-Order Mehrotra-Type Predictor-Corrector Algorithms over Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 949-965, September.
    12. Yasushi Narushima & Nobuko Sagara & Hideho Ogasawara, 2011. "A Smoothing Newton Method with Fischer-Burmeister Function for Second-Order Cone Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 149(1), pages 79-101, April.
    13. G. Q. Wang & Y. Q. Bai & X. Y. Gao & D. Z. Wang, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Interior-Point Methods for Semidefinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 242-262, April.
    14. de Klerk, E. & Peng, J. & Roos, C. & Terlaky, T., 2001. "A scaled Gauss-Newton primal-dual search direction for semidefinite optimization," Other publications TiSEM 9d85401c-e9d8-45ee-be2d-2, Tilburg University, School of Economics and Management.
    15. G. Lesaja & C. Roos, 2011. "Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 150(3), pages 444-474, September.
    16. B.V. Halldórsson & R.H. Tütüncü, 2003. "An Interior-Point Method for a Class of Saddle-Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 559-590, March.
    17. M. Zangiabadi & G. Gu & C. Roos, 2013. "A Full Nesterov–Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 816-858, September.
    18. Ali Mohammad-Nezhad & Tamás Terlaky, 2017. "A polynomial primal-dual affine scaling algorithm for symmetric conic optimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 577-600, April.
    19. G. Q. Wang & Y. Q. Bai, 2012. "A New Full Nesterov–Todd Step Primal–Dual Path-Following Interior-Point Algorithm for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 966-985, September.
    20. G. Q. Wang & L. C. Kong & J. Y. Tao & G. Lesaja, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 588-604, August.
    21. H. H. Bauschke & S. G. Kruk, 2004. "Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone," Journal of Optimization Theory and Applications, Springer, vol. 120(3), pages 503-531, March.
    22. Hongwei Liu & Ximei Yang & Changhe Liu, 2013. "A New Wide Neighborhood Primal–Dual Infeasible-Interior-Point Method for Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 796-815, September.

  6. Shinji Mizuno & Michael J. Todd & Yinyu Ye, 1995. "A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 20(1), pages 135-162, February.

    Cited by:

    1. Holder, A.G. & Sturm, J.F. & Zhang, S., 1998. "Analytic central path, sensitivity analysis and parametric linear programming," Econometric Institute Research Papers EI 9801, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. A.G. Holder & J.F. Sturm & S. Zhang, 1998. "Analytic Central Path, Sensitivity Analysis and Parametric Linear Programming," Tinbergen Institute Discussion Papers 98-003/4, Tinbergen Institute.

  7. Robert M. Freund & Michael J. Todd, 1995. "Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables," Mathematics of Operations Research, INFORMS, vol. 20(2), pages 415-440, May.
    See citations under working paper version above.
  8. Yinyu Ye & Michael J. Todd & Shinji Mizuno, 1994. "An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm," Mathematics of Operations Research, INFORMS, vol. 19(1), pages 53-67, February.

    Cited by:

    1. Berkelaar, A.B. & Dert, C.L. & Oldenkamp, K.P.B. & Zhang, S., 1999. "A primal-dual decomposition based interior point approach to two-stage stochastic linear programming," Econometric Institute Research Papers EI 9918-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. de Klerk, E. & Roos, C. & Terlaky, T., 1997. "Initialization in semidefinite programming via a self-dual, skew-symmetric embedding," Other publications TiSEM aa045849-1e10-4f84-96ca-4, Tilburg University, School of Economics and Management.
    3. Thomas Schmelzer & Raphael Hauser & Erling Andersen & Joachim Dahl, 2013. "Regression techniques for Portfolio Optimisation using MOSEK," Papers 1310.3397, arXiv.org.
    4. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Discussion Paper 2002-73, Tilburg University, Center for Economic Research.
    5. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1998. "Conic convex programming and self-dual embedding," Econometric Institute Research Papers EI 9815, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Freund, Robert Michael. & Mizuno, Shinji., 1996. "Interior point methods : current status and future directions," Working papers 3924-96., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    7. Zhang, S., 2002. "An interior-point and decomposition approach to multiple stage stochastic programming," Econometric Institute Research Papers EI 2002-35, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Berkelaar, Arjan & Dert, Cees & Oldenkamp, Bart, 1999. "A primal-dual decompsition-based interior point approach to two-stage stochastic linear programming," Serie Research Memoranda 0026, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    9. Coralia Cartis & Yiming Yan, 2016. "Active-set prediction for interior point methods using controlled perturbations," Computational Optimization and Applications, Springer, vol. 63(3), pages 639-684, April.
    10. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Discussion Paper 2001-27, Tilburg University, Center for Economic Research.
    11. Brendan O’Donoghue & Eric Chu & Neal Parikh & Stephen Boyd, 2016. "Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 1042-1068, June.

  9. Shinji Mizuno & Michael J. Todd & Yinyu Ye, 1993. "On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 964-981, November.

    Cited by:

    1. M. Sayadi Shahraki & H. Mansouri & M. Zangiabadi, 2017. "Two wide neighborhood interior-point methods for symmetric cone optimization," Computational Optimization and Applications, Springer, vol. 68(1), pages 29-55, September.
    2. M. Sayadi Shahraki & H. Mansouri & M. Zangiabadi, 2016. "A New Primal–Dual Predictor–Corrector Interior-Point Method for Linear Programming Based on a Wide Neighbourhood," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 546-561, August.
    3. Zhongyi Liu & Yue Chen & Wenyu Sun & Zhihui Wei, 2012. "A Predictor-corrector algorithm with multiple corrections for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 52(2), pages 373-391, June.
    4. Behrouz Kheirfam, 2014. "A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 853-869, June.
    5. Behrouz Kheirfam, 2015. "A Corrector–Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 246-260, January.
    6. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1996. "Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming," Econometric Institute Research Papers 9607/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. M. Salahi & T. Terlaky, 2007. "Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 132(1), pages 143-160, January.
    8. F. A. Potra & R. Sheng, 1998. "Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 99(1), pages 103-119, October.
    9. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Discussion Paper 2002-73, Tilburg University, Center for Economic Research.
    10. F. A. Potra & R. Sheng, 1998. "Superlinearly Convergent Infeasible-Interior-Point Algorithm for Degenerate LCP," Journal of Optimization Theory and Applications, Springer, vol. 97(2), pages 249-269, May.
    11. Filiz Gurtuna & Cosmin Petra & Florian Potra & Olena Shevchenko & Adrian Vancea, 2011. "Corrector-predictor methods for sufficient linear complementarity problems," Computational Optimization and Applications, Springer, vol. 48(3), pages 453-485, April.
    12. Yaguang Yang, 2013. "A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 859-873, September.
    13. Zhang, S., 2002. "An interior-point and decomposition approach to multiple stage stochastic programming," Econometric Institute Research Papers EI 2002-35, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    14. G. Y. Zhao, 1999. "Interior-Point Methods with Decomposition for Solving Large-Scale Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 102(1), pages 169-192, July.
    15. Maziar Salahi & Renata Sotirov & Tamás Terlaky, 2004. "On self-regular IPMs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(2), pages 209-275, December.
    16. Y. B. Zhao & J. Y. Han, 1999. "Two Interior-Point Methods for Nonlinear P *(τ)-Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 102(3), pages 659-679, September.

  10. Michael J. Todd, 1990. "A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm," Operations Research, INFORMS, vol. 38(6), pages 1006-1018, December.

    Cited by:

    1. Holder, A.G. & Sturm, J.F. & Zhang, S., 1998. "Analytic central path, sensitivity analysis and parametric linear programming," Econometric Institute Research Papers EI 9801, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Zhang, S., 1998. "Global error bounds for convex conic problems," Econometric Institute Research Papers EI 9830, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. A.G. Holder & J.F. Sturm & S. Zhang, 1998. "Analytic Central Path, Sensitivity Analysis and Parametric Linear Programming," Tinbergen Institute Discussion Papers 98-003/4, Tinbergen Institute.
    4. J.F. Sturm & S. Zhang, 1998. "On Sensitivity of Central Solutions in Semidefinite Programming," Tinbergen Institute Discussion Papers 98-040/4, Tinbergen Institute.
    5. Li-Zhi Liao, 2014. "A Study of the Dual Affine Scaling Continuous Trajectories for Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 163(2), pages 548-568, November.

  11. Michael J. Todd & Yinyu Ye, 1990. "A Centered Projective Algorithm for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 508-529, August.
    See citations under working paper version above.
  12. Clyde L. Monma & Alexander Schrijver & Michael J. Todd & Victor K. Wei, 1990. "Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions," Mathematics of Operations Research, INFORMS, vol. 15(4), pages 736-748, November.

    Cited by:

    1. Dvir Shabtay & George Steiner, 2007. "Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine," Manufacturing & Service Operations Management, INFORMS, vol. 9(3), pages 332-350, March.
    2. Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.
    3. Yedidsion, Liron & Shabtay, Dvir, 2017. "The resource dependent assignment problem with a convex agent cost function," European Journal of Operational Research, Elsevier, vol. 261(2), pages 486-502.
    4. Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y. & Malyutin, Sergey & Soukhal, Ameur, 2018. "Optimal workforce assignment to operations of a paced assembly line," European Journal of Operational Research, Elsevier, vol. 264(1), pages 200-211.
    5. Moshe Zofi & Ron Teller & Moshe Kaspi, 2017. "Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1177-1182, October.

  13. Michael J. Todd, 1988. "Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm," Mathematics of Operations Research, INFORMS, vol. 13(4), pages 650-659, November.

    Cited by:

    1. J. L. Goffin & F. Sharifi-Mokhtarian, 1999. "Primal–Dual–Infeasible Newton Approach for the Analytic Center Deep-Cutting Plane Method," Journal of Optimization Theory and Applications, Springer, vol. 101(1), pages 35-58, April.
    2. Freund, Robert Michael., 1987. "An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytope," Working papers 1921-87., Massachusetts Institute of Technology (MIT), Sloan School of Management.

  14. Robert G. Bland & Donald Goldfarb & Michael J. Todd, 1981. "Feature Article—The Ellipsoid Method: A Survey," Operations Research, INFORMS, vol. 29(6), pages 1039-1091, December.

    Cited by:

    1. Yaguang Yang, 2013. "A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 859-873, September.
    2. V. Balakrishnan & R. L. Kashyap, 1999. "Robust Stability and Performance Analysis of Uncertain Systems Using Linear Matrix Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 457-478, March.
    3. K. A. Ariyawansa & P. L. Jiang, 2000. "On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 107(2), pages 223-243, November.

  15. Robert B. Rovinsky & Christine A. Shoemaker & Michael J. Todd, 1980. "Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation," Operations Research, INFORMS, vol. 28(4), pages 859-866, August.

    Cited by:

    1. Jang, Joonkyung, 1992. "A spatial equilibrium analysis of the impact of transportation costs and policy changes on the export of U.S. beef and feed grains," ISU General Staff Papers 1992010108000017632, Iowa State University, Department of Economics.

  16. Todd, Michael J., 1979. "A note on computing equilibria in economies with activity analysis models of production," Journal of Mathematical Economics, Elsevier, vol. 6(2), pages 135-144, July.

    Cited by:

    1. Galeazzo Impicciatore & Luca Panaccione, 2007. "A Note on Equilibrium with Capital Goods, Storage and Production," Working Papers 99, University of Rome La Sapienza, Department of Public Economics.
    2. Galeazzo Impicciatore & Luca Panaccione & Francesco Ruscitti, 2012. "Walras’ theory of capital formation: an intertemporal equilibrium reformulation," Journal of Economics, Springer, vol. 106(2), pages 99-118, June.
    3. Galeazzo Impicciatore & Luca Panaccione & Francesco Ruscitti, 2009. "Intertemporal Equilibrium and Walras' Theory of Capital: a Projection Based Approach," Working Papers 121, University of Rome La Sapienza, Department of Public Economics.

  17. Michael J. Todd, 1976. "Orientation in Complementary Pivot Algorithms," Mathematics of Operations Research, INFORMS, vol. 1(1), pages 54-66, February.

    Cited by:

    1. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 3 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. No paper was announced in a field specific NEP report

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Michael Todd should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.