Остановите войну!
for scientists:
default search action
Michael J. Todd
- > Home > Persons > Michael J. Todd
Publications
- 2013
- [j83]Selin Damla Ahipasaoglu, Michael J. Todd:
A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms. Comput. Geom. 46(5): 494-519 (2013) - 2008
- [j78]Selin Damla Ahipasaoglu, Peng Sun, Michael J. Todd:
Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Methods Softw. 23(1): 5-19 (2008) - 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) - 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) - [j72]E. Alper Yildirim, Michael J. Todd:
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, Michael J. Todd:
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods. Math. Program. 90(2): 229-261 (2001) - 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
- [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, Michael J. Todd:
Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming. Math. Oper. Res. 21(2): 354-381 (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
- [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) - [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
- [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) - [j43]Michael J. Todd, Levent Tunçel:
A New Triangulation for Simplicial Algorithms. SIAM J. Discret. Math. 6(1): 167-180 (1993) - 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) - 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
- [j34]Michael J. Todd, Yinyu Ye:
A Centered Projective Algorithm for Linear Programming. Math. Oper. Res. 15(3): 508-529 (1990) - [j32]Yinyu Ye, Michael J. Todd:
Containing and Shrinking Ellipsoids in the Path-Following Algorithm. Math. Program. 47: 1-9 (1990) - 1981
- [j15]Robert M. Freund, Michael J. Todd:
A Constructive Proof of Tucker's Combinatorial Lemma. J. Comb. Theory, Ser. A 30(3): 321-325 (1981)
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-04-25 02:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint