{"id":32,"date":"2016-10-03T18:03:26","date_gmt":"2016-10-03T18:03:26","guid":{"rendered":"http:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-publications\/"},"modified":"2025-09-03T18:50:46","modified_gmt":"2025-09-03T18:50:46","slug":"research-activities","status":"publish","type":"page","link":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/","title":{"rendered":"Pubs\/Talks\/Collaborators"},"content":{"rendered":"<div id=\"pl-32\"  class=\"panel-layout\" ><div id=\"pg-32-0\"  class=\"panel-grid panel-no-style\" ><div id=\"pgc-32-0-0\"  class=\"panel-grid-cell\" ><div id=\"panel-32-0-0-0\" class=\"so-panel widget widget_mit-pf-biography widget_mit_pf_biography panel-first-child\" data-index=\"0\" >\t<div class=\"teasertext textwidget\"><blockquote>\n<h2 style=\"text-align: left;\">I support and stand with people who are not of my race \u2014 in the academic community and elsewhere \u2014 in protest against hate, brutality, divisiveness, fear, indifference, inequality, and discrimination.<\/h2>\n<\/blockquote>\n<\/div><\/div><div id=\"panel-32-0-0-1\" class=\"so-panel widget widget_mit-pf-wysiwyg widget_mit_pf_wysiwyg\" data-index=\"1\" ><div class=\"textwidget\"><h3 id=\"top\"><a href=\"#jump-to-publications\">Publications<\/a><\/h3>\n<h3><a href=\"#recent-talks-(most-recent-at-the-top)\">Recent Talks<\/a><\/h3>\n<h3><a href=\"#jump-to-students\">Current and Former Students and Coauthors<\/a><\/h3>\n<p id=\"jump-to-publications\"><span style=\"color: #ffffff\">\u00a0_<\/span><\/p>\n<\/div><\/div><div id=\"panel-32-0-0-2\" class=\"so-panel widget widget_mit-pf-research widget_mit_pf_research\" data-index=\"2\" ><h2 class=\"widget-title\">Publications<\/h2><div class=\"textwidget\"><h3>Books<\/h3>\n<p><a href=\"https:\/\/www.dynamic-ideas.com\/books\/ecbcnthsfb6hnzfdezpw0aldtvl9yr\" target=\"_blank\" rel=\"noopener\"><em>Data, Models, and Decisions: The Fundamentals of Management Science<\/em><\/a>, with Dimitris Bertsimas, Southwestern College Publishing, 2000, republished by Dynamic Ideas LLC, 2004.<\/p>\n<h3><\/h3>\n<p>&nbsp;<\/p>\n<h3>Refereed Journal Articles<\/h3>\n<p>\u201c<a href=\"https:\/\/doi.org\/10.1137\/22M1519286\" target=\"_blank\" rel=\"noopener\">Using Taylor-approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization<\/a>,\u201d with Zikai Xiong, <em>SIAM Journal on Optimization<\/em> vol. 34 (3), pp. 2503\u20142534 (2024). [<a href=\"https:\/\/www.dropbox.com\/scl\/fi\/d63182rhmcyikytovow34\/2208.13933v2-Using-taylor-approached-gradients.pdf?rlkey=sod552op83kjf1curua2y5psh&amp;st=p552mlaj&amp;dl=0\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]\u00a0 [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents?PublicationDocumentID=10415&amp;\" target=\"_blank\" rel=\"noopener\">Additional Results and Extensions<\/a>]<\/p>\n<p>\u201c<a href=\"https:\/\/doi.org\/10.1007\/s10107-022-01820-9\" target=\"_blank\" rel=\"noopener\">Analysis of the Frank-Wolfe Method for Convex Composite Optimization involving a Logarithmically-Homogeneous Barrier<\/a>,\u201d with Renbo Zhao, <em>Mathematical Programming <\/em>(2023) vol. 19, pp:123\u2013163. [<a href=\"https:\/\/www.dropbox.com\/s\/f2xn6q1wtl10q6n\/2022_Freund_LHSCB-FW-digital-published-final.pdf?dl=1\" target=\"_blank\" rel=\"noopener\">Full Paper<\/a>]<\/p>\n<p>\u201c<span style=\"color: black;\"><a href=\"http:\/\/doi.org\/10.1287\/moor.2023.1353\" target=\"_blank\" rel=\"noopener\">An \u2018Oblivious\u2019 Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities<\/a>,<\/span>\u201d with Jourdain Lamperski and Michael Todd, <i>Mathematics of Operations Research<\/i> vol. 49 (1), pp. 204-231 (2024) [<a href=\"https:\/\/www.dropbox.com\/s\/3xmis4wg9aemfkm\/2019_Freund_oblivious-ellipsoid-algorithm.pdf?dl=0\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p><a href=\"http:\/\/doi.org\/10.1007\/s10107-020-01480-7\" target=\"_blank\" rel=\"noopener\">Generalized Stochastic Frank-Wolfe Algorithm with Stochastic \u2018Substitute\u2019 Gradient for Structured Convex Optimization<\/a>,\u201d with Haihao Lu, <em>Mathematical Programming<\/em> vol. 187, pp. 317-349, 2021. [<a href=\"https:\/\/arxiv.org\/pdf\/1807.07680.pdf\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/17M1141369\" target=\"_blank\" rel=\"noopener\">Accelerated Residual Methods for the Iterative Solution of Systems of Equations<\/a>,\u201d with N. C. Nguyen, P. Fernandez, and J. Peraire, <em>SIAM Journal on Scientific Computing<\/em> vol. 40 (5), pp. A3157-A3179, 2018. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9642\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/16M1099546\" target=\"_blank\" rel=\"noopener\">Relatively Smooth Convex Optimization by First-Order Methods, and Applications<\/a>,\u201d with Haihao Lu and Yurii Nesterov, <em>SIAM Journal on Optimization<\/em> vol. 28 (1), pp. 333-354, 2018. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9641\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/s10107-017-1164-1\" target=\"_blank\" rel=\"noopener\">New Computational Guarantees for Solving Convex Optimization Problems with First Order Methods, via a Function Growth Condition Measure<\/a>,\u201d with Haihao Lu, <em>Mathematical Programming<\/em> 170, pp. 445-477, 2018.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/15M104726X\" target=\"_blank\" rel=\"noopener\">An Extended Frank-Wolfe Method with \u201cIn-Face\u201d Directions, and its Application to Low-Rank Matrix Completion<\/a>,\u201d with Paul Grigas and Rahul Mazumder, <em>SIAM Journal on Optimization<\/em> 27(1), pp. 319-346, 2017. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9644\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1214\/16-AOS1505\" target=\"_blank\" rel=\"noopener\">A New Perspective on Boosting in Linear Regression via Subgradient Optimization and Relatives<\/a>,\u201d with Paul Grigas and Rahul Mazumder, <em>Annals of Statistics<\/em> 45(6), pp. 2328-2364, 2017. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9643\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/14100275X\" target=\"_blank\" rel=\"noopener\">Functional regression for state prediction using linear PDE models and observations<\/a>,\u201d with N. C. Nguyen, H. Men, and J. Peraire, <em>SIAM Journal on Scientific Computing<\/em> 38 (2), pp. B247-B271, 2016. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9645\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1007\/s10107-014-0841-6\" target=\"_blank\" rel=\"noopener\">New Analysis and Results for the Frank-Wolfe Method<\/a>,\u201d (formerly titled \u201cNew Analysis and Results for the Conditional Gradient Method\u201d) with Paul Grigas, <em>Mathematical Programming<\/em> 155 (1), pp. 199-230, 2016. [<a href=\"http:\/\/hdl.handle.net\/1721.1\/103128\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\"<a href=\"http:\/\/dx.doi.org\/10.1016\/j.cma.2015.01.008\" target=\"_blank\" rel=\"noopener\">Gaussian Functional Regression for Linear Partial Differential Equations<\/a>,\" with Nguyen, Ngoc C., Han Men, Robert M. Freund and Jaime Peraire, <em>Computer Methods in Applied Mathematics and Engineering<\/em> Vol. 287, No. 15: 69-89, 2015.<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1364\/OE.22.022632\" target=\"_blank\" rel=\"noopener\">Robust topology optimization of three-dimensional photonic-crystal band-gap structures<\/a>,\u201d with H. Men, K. Y. K. Lee, J. Peraire, and S. G. Johnson, <em>Optics Express<\/em> 22 (19), pp. 22632-22648, September 2014. [<a href=\"http:\/\/hdl.handle.net\/1721.1\/90398\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1287\/opre.2013.1252\" target=\"_blank\" rel=\"noopener\">Fabrication-Adaptive Optimization, with an Application to Photonic Crystal Design<\/a>,\u201d with Han Men, Jaime Peraire, N.Cuong Nguyen, and Joel Saa-Seoane, <em>Operations Research<\/em> 62 (2), pp. 418-434, 2014. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9647\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1080\/10556788.2012.656114\" target=\"_blank\" rel=\"noopener\">An Accelerated First-Order Method for Solving Unconstrained SOS Polynomial Optimization Problems<\/a>,\" with Dimitris Bertsimas and Xu Andy Sun, <em>Optimization Methods and Software<\/em> 28 (3), pp. 424-441, 2013. [<a href=\"http:\/\/hdl.handle.net\/1721.1\/87686\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\"<a href=\"http:\/\/dx.doi.org\/10.1007\/s00339-012-7372-x\" target=\"_blank\" rel=\"noopener\">Binary Optimization Techniques for Linear PDE-Governed Material Design<\/a>,\" with Saa-Seoane, Joel, Ngoc Cuong Nguyen, Han Men, Robert M. Freund, and Jaime Peraire, <em>Journal of Applied Physics<\/em> A Vol. 109, No. 4: 1023-1030, 2012. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9650\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1103\/PhysRevE.85.049909\" target=\"_blank\" rel=\"noopener\">Design of Photonic Crystals with Multiple and Combined Band Gaps<\/a>,\u201d with H. Men, N.C. Nguyen, K.M. Lim, P. Parrilo, and J. Peraire, <em>Physical Review<\/em> E 83 (4), 2011. [<a href=\"https:\/\/dspace.mit.edu\/handle\/1721.1\/64936\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1016\/j.jcp.2010.01.023\" target=\"_blank\" rel=\"noopener\">Band Gap Optimization of Two-Dimensional Photonic Crystals Using Semi-definite Programming and Subspace Methods<\/a>,\" with H. Men, N.C. Nguyen, P. Parrilo, and J. Peraire, <em>Journal of Computational Physics<\/em> 229 (10), pp. 3706-3725, 2010. [<a href=\"https:\/\/dspace.mit.edu\/handle\/1721.1\/69624\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1287\/moor.1090.0408\" target=\"_blank\" rel=\"noopener\">Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model<\/a>,\u201d with Jorge Vera, <em>Mathematics of Operations Research<\/em> 34 (4), pp. 869-879, 2009. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9655\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1287\/moor.1090.0388\" target=\"_blank\" rel=\"noopener\">An Efficient Re-Scaled Perceptron Algorithm for Conic Systems<\/a>,\u201d with Alexandre Belloni and Santosh Vempala, <em>Mathematics of Operations Research<\/em> 34 (3), pp. 621-641, 2009. [<a href=\"https:\/\/dspace.mit.edu\/handle\/1721.1\/54782\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1137\/06067198X\" target=\"_blank\" rel=\"noopener\">On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection<\/a>,\u201d with Alexandre Belloni, <em>SIAM Journal on Optimization<\/em> 19 (3), pp. 1073-1092, 2008. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9656\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1287\/mnsc.1080.0864\" target=\"_blank\" rel=\"noopener\">Optimizing Product Line Designs: Efficient Methods and Comparisons<\/a>,\u201d with Alexandre Belloni, Matthew Selove, and Duncan Simester, <em>Management Science<\/em> (54) 9, pp. 1544-1552, 2008. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9658\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1007\/s10107-007-0203-8\" target=\"_blank\" rel=\"noopener\">A Geometric Analysis of Renegar\u2019s Condition Number, and its Interplay with Conic Curvature<\/a>,\u201d with Alexandre Belloni, <em>Mathematical Programming<\/em> 119 (1), pp. 95-107, 2009. [<a href=\"https:\/\/dspace.mit.edu\/handle\/1721.1\/54761\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1007\/s10107-007-0192-7\" target=\"_blank\" rel=\"noopener\">Projective Re-Normalization for Improving the Behavior of a Homogeneous Conic Linear System<\/a>,\u201d with Alexandre Belloni, <em>Mathematical Programming<\/em> 118, pp. 279-299, 2009. [<a href=\"https:\/\/dspace.mit.edu\/handle\/1721.1\/54746\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1007\/s10107-006-0035-y\" target=\"_blank\" rel=\"noopener\">Behavioral Measures and their Correlation with IPM Iteration Counts on Semi-Definite Programming Problems<\/a>,\u201d with Fernando Ord\u00f3\u00f1ez and Kim Chuan Toh, <em>Mathematical Programming<\/em> 109 (vol. 2-3), pp. 445-475, 2007. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9659\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1007\/s10107-006-0074-4\" target=\"_blank\" rel=\"noopener\">On the Symmetry Function of a Convex Set<\/a>,\u201d with Alexandre Belloni, <em>Mathematical Programming<\/em> (111), pp. 57-93 , 2008. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9657\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1007\/s10107-005-0667-3\" target=\"_blank\" rel=\"noopener\">On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization<\/a>,\u201d <em>Mathematical Programming<\/em> (106), pp. 527-545, 2006. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9661\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1007\/s10589-005-3911-0\" target=\"_blank\" rel=\"noopener\">On Two Measures of Problem Instance Complexity and their Correlation with the Performance of SeDuMi on Second-Order Cone Problems<\/a>,\u201d with Zhi Cai, <em>Computational Optimization and Applications<\/em> (34) 3, pp. 299-320, 2006. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9660\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1287\/moor.1040.0120\" target=\"_blank\" rel=\"noopener\">On an Extension of Condition Number Theory to Non-conic Convex Optimization<\/a>,\u201d with Fernando Ord\u00f3\u00f1ez, <em>Mathematics of Operations Research<\/em> 30 (1), pp. 173-194, 2005. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9662\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1287\/opre.1040.0115\" target=\"_blank\" rel=\"noopener\">Computation of Minimum Volume Covering Ellipsoids<\/a>,\u201d with Peng Sun,<em> Operations Research<\/em> 52 (5), pp. 690-706, 2004. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9664\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/s10107-003-0435-1\" target=\"_blank\" rel=\"noopener\">Complexity of Convex Optimization using Geometry-Based Measures and a Reference Point<\/a>,\u201d <em>Mathematical Programming<\/em> (99), pp. 197-221, 2004. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9663\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1287\/moor.28.4.625.20509\" target=\"_blank\" rel=\"noopener\">On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System<\/a>,\u201d with Jorge Vera, <em>Mathematics of Operations Research<\/em> 28 (4), pp. 625-648, 2003.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/S1052623402401804\" target=\"_blank\" rel=\"noopener\">Computational Experience and the Explanatory Value of Condition Numbers for Linear Optimization<\/a>,\u201d with Fernando Ord\u00f3\u00f1ez, <em>SIAM Journal on Optimization<\/em> 14 (2), pp. 307-333, 2004. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9665\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1023\/A:1022977709811\" target=\"_blank\" rel=\"noopener\">Solution Methodologies for the Smallest Enclosing Circle Problem<\/a>,\u201d with Sheng Xu and Jie Sun, <em>Computational Optimization and Applications<\/em> 25, pp. 283-292, 2003.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/S1052623401393645\" target=\"_blank\" rel=\"noopener\">On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization<\/a>,\u201d <em>SIAM Journal on Optimization<\/em> 13 (4), pp. 1004-1013, 2003. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9666\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/S1052623400373829\" target=\"_blank\" rel=\"noopener\">A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems<\/a>,\u201d with Marina Epelman, <em>SIAM Journal on Optimization<\/em> 12 (3), pp. 627-655, 2002. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9667\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/S105262349936063X\" target=\"_blank\" rel=\"noopener\">Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semi-Definite Program<\/a>,\" with Manuel Nunez, <em>SIAM Journal on Optimization<\/em> 11 (3), pp. 818-836, 2001. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9668\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/s101070000136\" target=\"_blank\" rel=\"noopener\">Condition Number Complexity of an Elementary Algorithm for Computing a Reliable Solution of a Conic Linear System<\/a>,\u201d with Marina Epelman, <em>Mathematical Programming<\/em> 88 (3), pp. 451-485, 2000. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9669\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/978-1-4757-3216-0_18\" target=\"_blank\" rel=\"noopener\">Interior Point Methods: Current Status and Future Directions<\/a>,\u201d with Shinji Mizuno, in High Performance Optimization, H. Frenk et al. (eds.), <em>Kluwer Academic Publishers<\/em>, pp. 441-466, 2000. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=2397\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/S105262349732829X\" target=\"_blank\" rel=\"noopener\">Condition Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm<\/a>,\u201d with Jorge R. Vera, <em>SIAM Journal on Optimization<\/em> 10 (1), 155-176, 2000. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9671\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/s10107990063a\" target=\"_blank\" rel=\"noopener\">Some Characterizations and Properties of the \u2018Distance to Ill-Posedness\u2019 and the Condition Measure of a Conic Linear Systems<\/a>,\u201d with Jorge. R. Vera, <em>Mathematical Programming<\/em> 86, pp. 225-260, 1999. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9670\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/BF02680548\" target=\"_blank\" rel=\"noopener\">Condition Measures and Properties of the Central Trajectory of a Linear Program<\/a>,\u201d with Manuel A. Nunez, <em>Mathematical Programming<\/em> 83 (1), pp. 1-28, 1998. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9672\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/BF02206810\" target=\"_blank\" rel=\"noopener\">An Infeasible-Start Algorithm for Linear Programming whose Complexity Depends on the Distance from the Starting Point to the Optimal Solution<\/a>,\u201d <em>Annals of Operations Research<\/em> 62, pp. 29-58, 1996.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1287\/moor.21.4.839\" target=\"_blank\" rel=\"noopener\">Following a \u201cBalanced\u201d Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-time Algorithm<\/a>,\u201d <em>Mathematics of Operations Research<\/em> 21 (4) 839-859, 1996.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1287\/moor.20.2.415\" target=\"_blank\" rel=\"noopener\">Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero, One-, or Two-Sided Bounds on the Variables<\/a>,\u201d with Michael J. Todd, <em>Mathematics of Operations Research<\/em> (20) 2, 415-440, 1995.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1137\/0805014\" target=\"_blank\" rel=\"noopener\">A Potential Reduction Algorithm with user-specified Phase I - Phase II Balance, for Solving a Linear Program from an Infeasible Warm Start<\/a>,\u201d <em>SIAM Journal of Optimization<\/em> (5) 2, 247-268, 1995.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1016\/0167-6377(92)90024-W\" target=\"_blank\" rel=\"noopener\">Prior Reduced Fill-In in Solving Equations in Interior-Point Algorithms<\/a>,\u201d with John Birge and Robert Vanderbei, <em>Operations Research Letters<\/em> (11), pp. 195-198, 1992.<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1007\/BF01582900\" target=\"_blank\" rel=\"noopener\">A Potential Function Reduction Algorithm for Solving a Linear Program Directly from an Infeasible \u201cWarm Start\u201d<\/a>,\u201d <em>Mathematical Programming<\/em> (52), pp. 441-466, 1991.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/BF01581277\" target=\"_blank\" rel=\"noopener\">Projective Transformation for Interior-Point Algorithms, and a Superlinearly Convergent Algorithm for the W-Center Problem<\/a>,\u201d <em>Mathematical Programming<\/em> 58, pp. 385-414, 1993. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9674\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1287\/moor.16.4.775\" target=\"_blank\" rel=\"noopener\">A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming<\/a>,\u201d with K. C. Tan, <em>Mathematics of Operations Research<\/em> (16), pp. 775-801, 1991.<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1016\/0024-3795(91)90265-X\" target=\"_blank\" rel=\"noopener\">Theoretical Efficiency of a Shifted Barrier Function Algorithm for Linear Programming<\/a>,\u201d <em>Linear Algebra and its Applications<\/em> (152), pp. 19-41, 1991.<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1007\/BF01586933\" target=\"_blank\" rel=\"noopener\">Polynomial-Time Algorithms for Linear Programming based only on Primal Scaling and Projected Gradients of a Potential Function<\/a>,\u201d<em> Mathematical Programming<\/em> (51), pp. 203-222, 1991.<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1287\/mnsc.36.4.449\" target=\"_blank\" rel=\"noopener\">Optimal Investment in Product Flexible Manufacturing Capacity<\/a>,\u201dwith C. Fine, <em>Management Science<\/em> (36), pp. 449-466, 1990. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9675\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1016\/0095-8956(89)90020-8\" target=\"_blank\" rel=\"noopener\">Combinatorial Analogs of Brouwer\u2019s Fixed Point Theorem on a Bounded Polyhedron<\/a>,\u201d <em>Journal of Combinatorial Theory<\/em>, Series B (47), pp. 192-219, 1989.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1016\/0167-6377(88)90045-4\" target=\"_blank\" rel=\"noopener\">An Analog of Karmarkar\u2019s Algorithm for Inequality Constrained Linear Programs, with a 'New' Class of Projective Transformations for Centering a Polytope<\/a>,\u201d<em> Operations Research Letters<\/em> (7), pp. 9-14, 1988.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/BF02591851\" target=\"_blank\" rel=\"noopener\">Dual Gauge Programs, with Applications to Quadratic Programming and the Minimum Norm Problem<\/a>,\u201d <em>Mathematical Programming<\/em> (38), pp.47-68, 1987.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1287\/moor.11.1.169\" target=\"_blank\" rel=\"noopener\">Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube<\/a>,\u201d <em>Mathematics of Operations Research<\/em> (11) , pp. 169-179, 1986.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/BFb0121039\" target=\"_blank\" rel=\"noopener\">Postoptimal Analysis of a Linear Program under Simultaneous Changes in Matrix Coefficients<\/a>,\u201d <em>Mathematical Programming Study<\/em> 24, pp. 1-13, 1985. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9681\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/BF01582241\" target=\"_blank\" rel=\"noopener\">On the Complexity of Four Polyhedral Set Containment Problems<\/a>,\u201d with James B. Orlin, <em>Mathematical Programming<\/em> (33), pp.133-145, 1985.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1287\/moor.9.4.498\" target=\"_blank\" rel=\"noopener\">Variable Dimension Complexes, Part II: A Unified Approach to Some Combinatorial Lemmas in Topology<\/a>,\u201d <em>Mathematics of Operations Research<\/em> (9), pp. 498-509, 1984.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1287\/moor.9.4.479\" target=\"_blank\" rel=\"noopener\">Variable Dimension Complexes, Part I: Basic Theory<\/a>,\u201d <em>Mathematics of Operations Research<\/em> (9), pp. 479-497, 1984.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/BF01583784\" target=\"_blank\" rel=\"noopener\">Optimal Scaling of Balls and Polyhedra<\/a>,\u201d with B.C. Eaves, <em>Mathematical Programming<\/em> (23), pp. 138-147 , 1982.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1016\/0097-3165(81)90027-3\" target=\"_blank\" rel=\"noopener\">A Constructive Proof of Tucker\u2019s Combinatorial Lemma<\/a>,\u201d with M.J. Todd, <em>Journal of Combinatorial Theory<\/em> (30), pp. 321-325, 1981.<\/p>\n<p>&nbsp;<\/p>\n<h3>Papers submitted for Publication or in Preparation<\/h3>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/scl\/fi\/mklmtlkt12l1m602g0xcx\/2406.01942v3.pdf?rlkey=5qznye5nrl670e218x9bk37mq&amp;st=nnxacduy&amp;dl=0\" target=\"_blank\" rel=\"noopener\">The Role of Level-Set Geometry on the Performance of PDHG for Conic Linear Optimization<\/a>,\u201d\u00a0with Zikai Xiong, submitted.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/scl\/fi\/njyt7edle74n8x5gxevk0\/Computational-Guarantees-for-Restarted-PDHG-for-LP-based-on-Limiting-Error-Ratios.pdf?rlkey=lqhf1cp2g0v3dhrqd7ctux0uf&amp;dl=0\" target=\"_blank\" rel=\"noopener\">Computational Guarantees for Restarted PDHG for LP based on \u201cLimiting Error Ratios<\/a>\u201d and LP Sharpness,\u201d\u00a0with Zikai Xiong, submitted.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.48550\/arXiv.2301.01530\" target=\"_blank\" rel=\"noopener\">Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses<\/a>,\u201d with Shuvomoy Das Gupta, Xu Andy Sun, and Adrien Taylor, January 2023.<\/p>\n<p>&nbsp;<\/p>\n<h3>Papers in Refereed Conference Proceeding<\/h3>\n<p>\u201cStochastic Frank-Wolfe for Constrained Finite-Sum Minimization\u201d with Geoffrey N\u00e9giar, Gideon Dresdner, Alicia Yi-Ting Tsai, Laurent El Ghaoui, Francesco Locatello, and Fabian Pedregosa, International Conference on Machine Learning (ICML), June 2020. [<a href=\"https:\/\/doi.org\/10.48550\/arXiv.2002.11860\" target=\"_blank\" rel=\"noopener\">Full Paper<\/a>]<\/p>\n<p>\u201cAccelerating Greedy Coordinate Descent Methods,\u201d International Conference on Machine Learning (ICML), Stockholm, Sweden, July 2018. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=4768\" target=\"_blank\" rel=\"noopener\">Full Paper<\/a>] [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=4769\" target=\"_blank\" rel=\"noopener\">Supplementary Material<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1115\/IMECE2013-64694\" target=\"_blank\" rel=\"noopener\">Designing Phononic Crystals with Convex Optimization<\/a>\u201d with Han Men, N.-C. Nguyen, Joel Saa-Seoane, and Jaime Peraire, ASME2013 International Mechanical Engineering Congress and Exposition, pp. V014T15A047, San Diego, November 2013.<\/p>\n<p>\u201cA First-Order View of Boosting Methods: Computational Complexity and Connections to Regularization\u201d with Paul Grigas and Rahul Mazumder, International Workshop on Advances in Regularization, Optimization, Kernel Methods and Support Vector Machines: Theory and Applications, Leuven, Belgium July 2013.<\/p>\n<p>\u201cA Binary Optimization Method for Linear Metamaterial Design Optimization,\u201d with J. Saa-Seoane, N.-C. Nguyen, H. Men, and J. Peraire, to appear in<em> 3rd International Conference on Metamaterials, Photonic Crystals and Plasmonics<\/em>, 2012.<\/p>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1287\/moor.1090.0388\" target=\"_blank\" rel=\"noopener\">An Efficient Re-Scaled Perceptron Algorithm for Conic Systems<\/a>,\u201d with Alexandre Belloni and Santosh Vempala, <em>Proceedings of the 2007 Conference on Learning Theory<\/em>. [<a href=\"https:\/\/dspace.mit.edu\/handle\/1721.1\/54782\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1109\/NNSP.1997.622408\" target=\"_blank\" rel=\"noopener\">An Improved Training Algorithm for Support Vector Machines<\/a>,\u201d with Edgar Osuna and Federico Girosi, in <em>Proceedings of IEEE NNSP\u201997<\/em>, Amelia Island, Florida, September 1997. [<a href=\"http:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=622375\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201c<a href=\"http:\/\/dx.doi.org\/10.1109\/CVPR.1997.609310\" target=\"_blank\" rel=\"noopener\">Training Support Vector Machines: an Application to Face Detection<\/a>,\u201d with Edgar Osuna and Federico Girosi, in <em>IEEE Computer Society Conference on Computer Vision and Pattern Recognition<\/em>, Puerto Rico, June 1997. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=9637\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>&nbsp;<\/p>\n<h3>Edited Volumes and Invited papers in Conference Proceedings<\/h3>\n<p>\u201c<a href=\"http:\/\/doi.org\/10.1007\/978-1-4757-3216-0_18\" target=\"_blank\" rel=\"noopener\">Interior Point Methods: Current Status and Future Directions<\/a>,\u201d with Shinji Mizuno, Optima 51, pp. 1-9, 1996. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=2397\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>Guest Editor, special volume of <em>Annals of Operations Research<\/em> on Interior Point Methods in Mathematical Programming, 1996.<\/p>\n<p>\u201cEconomic Analysis of Product Flexible Manufacturing System Investment Decisions,\u201dwith C. Fine, <em>Proceedings of the Second ORSA\/TIMS Conference on Flexible Manufacturing Systems<\/em>, 1986, (invited, not refereed), Kathryn Stecke and Rajan Suri, (eds.), Elsevier, Amsterdam, 1986. [<a href=\"http:\/\/dspace.mit.edu\/bitstream\/handle\/1721.1\/2136\/SWP-1757-15174406.pdf?sequence=1\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>&nbsp;<\/p>\n<h3>Others<\/h3>\n<p>\u201cOn the Relation Between LP Sharpness and Limiting Error Ratio and Complexity Implications for Restarted PDHG,\u201d with Zikai Xiong, MIT Operations Research Center working. [<a href=\"https:\/\/doi.org\/10.48550\/arXiv.2312.13773\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201cCondition Number Analysis of Logistic Regression, and its Implications for Standard First-Order Solution Methods,\u201d with Paul Grigas and Rahul Mazumder, arXiv:1810.08727, 2018. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=6064\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201cAdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods,\u201d with Paul Grigas and Rahul Mazumder, MIT Operations Research Center working paper OR 397-14, 2014. [<a href=\"http:\/\/dspace.mit.edu\/handle\/1721.1\/85665\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201cBandwidth optimization of single-polarization single-mode photonic crystal fibers,\u201d with Han Men, Jaime Peraire, and N.Cuong Nguyen, 2013.<\/p>\n<p>\u201cCondition Number Complexity of an Elementary Algorithm for Resolving a Conic Linear System,\u201d with Marina Epelman, Sloan Working Paper # 97-3942, 1997.<\/p>\n<p>\u201cReasoning with Incomplete Knowledge Using de Finetti\u2019s Fundamental Theorem of Probability: Background and Computational Issues,\u201d with Tracy Myers and Gordon Kaufman, Sloan Working Paper # 97-3990, 1997.<\/p>\n<p>\u201cComplexity of an Algorithm for Finding an Approximate Solution of a Semi-Definite Program, with no Regularity Condition,\u201d O.R. Center Working Paper 302-94, December 1994. [<a href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=1927\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201cImplementation and Empirical Study of a Combined Phase I - Phase II Potential Reduction Algorithm for Linear Programming,\u201d with Hitendra Wadhwa, Sloan School Working Paper #3411-92-MSA, March 1992. [<a href=\"http:\/\/dspace.mit.edu\/handle\/1721.1\/2401\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201cProjective Transformations for Interior Point Methods, Part II: Analysis of An Algorithm for finding the Weighted Center of a Polyhedral System,\u201d O.R. Working Paper 180 88, June 1988. [<a href=\"http:\/\/dspace.mit.edu\/handle\/1721.1\/5273\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201cProjective Transformations for Interior Point Methods, Part I: Basic Theory and Linear Programming,\u201d O.R. Working Paper 179 88, June 1988. [<a href=\"http:\/\/dspace.mit.edu\/handle\/1721.1\/5246\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201cOptimal Investment in Flexible Manufacturing Capacity, Part II: Computing Solutions,\u201d with C. Fine, Sloan School Working Paper #1803-86, July 1986.<\/p>\n<p>\u201cHidden Minimum Norm Problems in Quadratic Programming,\u201d Sloan School Working Paper # 1768-86, 1986.<\/p>\n<p>\u201cIdentifying the Set of Always-Active Constraints in a System of Linear Inequalities by a Single Linear Program,\u201d with R. Roundy and M.J. Todd, Sloan School Working Paper # 1674-85, 1985. [<a href=\"http:\/\/dspace.mit.edu\/handle\/1721.1\/2111\" target=\"_blank\" rel=\"noopener\">Working Paper<\/a>]<\/p>\n<p>\u201cOn Kuhn\u2019s Strong Cubical Lemma,\u201d Working Paper #1557-84, Sloan School of Management, M.I.T., 1984.<\/p>\n<p>\u201cApplications of a Generalization of a Set Intersection Theorem of von Neumann,\u201d Working Paper # 1528-84, Sloan School of Management, M.I.T., 1984.<\/p>\n<p id=\"recent-talks-(most-recent-at-the-top)\"><span style=\"color: #ffffff;\">\u00a0_<\/span><\/p>\n<\/div><\/div><div id=\"panel-32-0-0-3\" class=\"so-panel widget widget_mit-pf-wysiwyg widget_mit_pf_wysiwyg\" data-index=\"3\" ><h2 class=\"widget-title\">Recent Talks (most recent at the top)<\/h2><div class=\"textwidget\"><p>\"<a href=\"https:\/\/www.dropbox.com\/scl\/fi\/blon670i813yfkjbx80d9\/rice-rmf-999-Read-Only.pdf?rlkey=6w2rup8x6j7da51qr63qfixhj&amp;st=2l4wuias&amp;dl=0\">Level-Set Geometry and the Performance of Restarted-PDHG for Conic LP<\/a>,\" with Zikai Xiong. Presentation ISMP Montreal, July 2024, also Stanford University MS&amp;E Department, July 2024.<\/p>\n<p><a href=\"https:\/\/www.dropbox.com\/scl\/fi\/tz6oaypt9v98wj9oyl6ni\/Lehigh-rmf-002-2.pdf?rlkey=tf4zjxoh69zit3ls7viggn21l&amp;dl=0\" target=\"_blank\" rel=\"noopener\">\u201cLevel-Set Geometry and the Performance of Restarted-PDHG for Conic LP,\u201d<\/a> the Spencer C. Schantz Lecture at Lehigh University, Bethlehem, PA, April 11, 2024.<\/p>\n<p class=\"p1\"><a href=\"https:\/\/www.dropbox.com\/scl\/fi\/blon670i813yfkjbx80d9\/rice-rmf-999-Read-Only.pdf?rlkey=6w2rup8x6j7da51qr63qfixhj&amp;dl=0\" target=\"_blank\" rel=\"noopener\">\u201cLevel-Set Geometry and the Performance of Restarted-PDHG for Conic LP,\u201d<\/a> INORMS Optimization Conference, Rice University, Houston, TX, March 23, 2024.<\/p>\n<p class=\"p1\"><a href=\"https:\/\/www.dropbox.com\/scl\/fi\/ug8xffcrqv84oltjtvttq\/Rob_talk_in_Atlanta-zx-009-Read-Only.pdf?rlkey=aey9as2oohr6z4b4ftc9hka4v&amp;dl=0\" target=\"_blank\" rel=\"noopener\">\u201cLevel-Set Geometry and the Performance of Restarted-PDHG for Conic LP,\u201d<\/a> OPT4AI Seminar, Georgia Institute of Technology, Atlanta, GA, February 22, 2024.<\/p>\n<p style=\"font-weight: 400;\">\u201cPredictive Business Analytics,\u201d Universidad del Pacifico, Certificate Program in Data Science and Business Analytics, Lima, Peru, November 8-9, 2023.<\/p>\n<p style=\"font-weight: 400;\">\u201cIntroduction to Practical Predictive and Prescriptive Analytics,\u201d\u00a0 Universidad de Chile Master\u2019s Program in Data Science and Business Analytics, Santiago, Chile, November 3-4, 2023.<\/p>\n<p style=\"font-weight: 400;\">\u201cAlgorithms for Business Analytics: Recommender Systems, Fairness, and Efficiency,\u201d MIT Club of Chile, Santiago, Chile, November 2, 2023.<\/p>\n<p style=\"font-weight: 400;\"><a href=\"https:\/\/www.dropbox.com\/scl\/fi\/asf9a0tdlvvflc6hl2yg5\/INFORMS-version-simplified-slide-zx-001.pdf?rlkey=t6c0rumnguwh0s3d7f8wffajk&amp;dl=0\" target=\"_blank\" rel=\"noopener\">\u201cImproving the Geometry of (Conic) Linear Optimization Problems for the Primal-Dual Hybrid Gradient Method (PDHG),\u201d<\/a> INFORMS Annual Meeting, Phoenix, AZ, October 17, 2023.<\/p>\n<p style=\"font-weight: 400;\"><a href=\"https:\/\/www.dropbox.com\/scl\/fi\/xvd4mjum5h2i5pncbod79\/simplified-slide-zx-001.pdf?rlkey=u4c183dtlteywi9hw8rah41vq&amp;dl=0\" target=\"_blank\" rel=\"noopener\">\u201cImproving the Geometry of (Conic) Linear Optimization Problems for the Primal-Dual Hybrid Gradient Method (PDHG),\u201d<\/a> Princeton University, Princeton, NJ, October 6, 2023.<\/p>\n<p><a href=\"https:\/\/www.dropbox.com\/scl\/fi\/98arrpppmpmfkuqfvihco\/Rob-talk-on-large-scaleLP-slides-rmf-v01.pdf?rlkey=36sz5hpc94k1xcuj68ek2pvpb&amp;dl=0\" target=\"_blank\" rel=\"noopener\">\u201cImproving the Geometry of (Conic) Linear Optimization Problems for the Primal-Dual Hybrid Gradient Method (PDHG),\u201d<\/a> AFOSR Mathematical Optimization Annual Program Review, Arlington, VA, August 28-30, 2023<\/p>\n<p><a href=\"https:\/\/www.dropbox.com\/s\/zujhst93pp1x0g5\/2022%20Freund%20Some%20Recent%20Research%20in%20First-Order%20Methods%20for%20Linear%20Programming.pdf?dl=0\" target=\"_blank\" rel=\"noopener\">\"Some Recent Research in First-Order Methods for Linear Programming,\u201d<\/a> Workshop on Optimization in the Big Data Era, Institute for Mathematical Sciences, National University of Singapore, December, 2022.<\/p>\n<p><a href=\"https:\/\/www.dropbox.com\/s\/uw148ap8p0zu5ag\/Xiong-Freund_PT_2022-Seattle-ASL60-Workshop.pdf?dl=1\" target=\"_blank\" rel=\"noopener\">\"Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization,\"<\/a> Workshop on Modern Nonsmooth Optimization, University of Washington, Seattle, August 2022.<\/p>\n<p><a href=\"https:\/\/www.dropbox.com\/s\/uw148ap8p0zu5ag\/Xiong-Freund_PT_2022-Seattle-ASL60-Workshop.pdf?dl=1\" target=\"_blank\" rel=\"noopener\">\"Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization,\"<\/a> International Conference on Continuous Optimization (ICCOPT), Lehigh University, Bethlehem, PA, July 2022.<\/p>\n<p><a href=\"https:\/\/www.dropbox.com\/s\/h72jhvyjv9c8zak\/New%20Theory%20and%20Improved%20Computational%20Performance%20of%20the%20Frank-Wolfe%20Method%20for%20Data%20Science%20Applications%20.3cm.pdf?dl=0\" target=\"_blank\" rel=\"noopener\">\"New Theory and Improved Computational Performance of the Frank-Wolfe Method for Data Science Applications,\u201d<\/a> Distinguished ADSE Seminar Series, City University of Hong Kong, December 2021.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/8132009ua1axah2\/RFreund_PT_2021_Chicago_NewTheory.pdf?dl=0\" target=\"_blank\" rel=\"noopener\">New Theory and Improved Computational Performance of the Frank-Wolfe Method for Data Science Applications<\/a>,\u201d University of Chicago Booth School of Business, November 2021.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/bzxd4qugh6aft9m\/2020_Freund_Accelerated_First-Order_Methods.pdf?dl=0\">Accelerated First-Order Methods for Exascale Simulation and Learning<\/a>,\" with Cuong Nguyen and Jaime Peraire. Presentation, AFOSR Program Review. August 2020<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/lx6gmmfv7nnl2r9\/2020_Freund_Stochastic_Frank-Wolfe.pdf?dl=0\">From Stochastic Frank-Wolfe to the Ellipsoid Method: Recent Progress on Practical Optimization in Machine Learning (the Frank-Wolfe Method) and Theoretical Optimization (the Ellipsoid Method)<\/a>\", Webinar on Mathematical Foundations of Data Science, June 2020.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/vb9a2nwftr6bglv\/2019_Freund_Condition_Number_Analysis_of_Logistic_Regression_November.pdf?dl=0\">Condition Number Analysis of Logistic Regression, and its Implications for First-Order Solution Methods<\/a>,\" Duke University, November 2019.<\/p>\n<p>\"Advanced Prediction Models, and Social Networks\", invited lectures for the MIT and Universidad de Chile Joint Certificate Program in Data Analytics, October, 2019.<\/p>\n<p>\"Ethics and Fairness in Machine Learning Models and Data-Driven Decision Making\", MIT Alumni Club of Chile, October, 2019.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/9og3dh9c1fsyqqi\/2019_Freund_Obvious%20Ellipsoid_Algorithm.pdf?dl=0\">An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities<\/a>,\" Universaidad de Chile, October 2019.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/wk19jhdylisa97m\/2019_Freund_Condition_Number_Analysis_of_Logistic_Regression.pdf?dl=0\">Condition Number Analysis of Logistic Regression, and its Implications for First-Order Solution Methods<\/a>,\" Pontificia Universidad Cat\u00f3lica, Santiago, Chile, October 2019.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/3isdd26wf21say8\/2019_Freund_PT_Scalable_Accelerated_Algorithms.pdf?dl=1\">Accelerated First-Order Methods for Exascale Simulation and Learning<\/a>,\" with Cuong Nguyen and Jaime Peraire. Presentation, AFOSR Program Review. August 2019.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/4tfmrlqrks1eqpy\/Berlin-ICCOPT-2019-Rob-slides-v3.pdf?dl=1\">An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities<\/a>,\" with Jourdain Lamperski and Michael Todd. Presentation, ICCOPT Berlin, Germany. August 2019.<\/p>\n<p><a href=\"http:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/30\/2019\/05\/07144136\/CMU-Tepper-logistic-regression-only-GCD-v2.0.pdf\">Condition Number Analysis of Logistic Regression, and its Implications for First-Order Solution Methods,\"<\/a>\u00a0Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, Carnegie Mellon - Tepper, Pittsburgh PA, May, 2019<\/p>\n<p><a href=\"http:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/30\/2018\/11\/02165241\/GSFW-rob-Phoenix.pdf\">\"Generalized Stochastic Frank-Wolfe Algorithm with Stochastic \\Substitute\" Gradient for Structured Convex Optimization,<\/a>\" Haihao (Sean) Lu, Robert M. Freund INFORMS, Phoenix, 2018<\/p>\n<p>\"<a href=\"http:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/30\/2018\/08\/22173728\/AFOSR-August-2018-rmf-2.pdf\">Accelerated First-Order Methods for Exascale Simulation and Learning<\/a>,\" Robert M. Freund, Cuong Nguyen, and Jaime Peraire, ASFOR, August 2018<\/p>\n<p>\"<a href=\"http:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/30\/2018\/06\/28170427\/ASCD-Bordeaux-2.0.pdf\">Accelerating Greedy Coordinate Descent Methods<\/a>,\" Lu, Haihao (Sean), Robert M. Freund, and Vahab Morrokni. Presentation ISMP Bordeaux, July 2018<\/p>\n<p><a href=\"http:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/30\/2018\/03\/27145313\/PSU-logistic-regression-only-GCD-v2.0.pdf\">\"Condition Number Analysis of Logistic Regression, and its Implications for First-Order Solution Methods,\u201d<\/a> Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, Pennsylvania State University, State College PA, March 2018<\/p>\n<p><a href=\"http:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/30\/2018\/03\/27145620\/Denver-INFORMS-logistic-regression-only-GCD.pdf\">\"Condition Number Analysis of Logistic Regression, and its Implications for First-Order Solution Methods,<\/a>\" Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, INFORMS Optimization Conference, Denver, CO, March 2018<\/p>\n<p>\"<a href=\"http:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/30\/2017\/10\/12145113\/Houston-INFORMS-logistic-regression-only-GCD.pdf\">Condition Number Analysis of Logistic Regression, and its Implications for First-Order Solution Methods<\/a><a href=\"https:\/\/www.dropbox.com\/s\/pxzk2tefrxu9rgc\/UIUC-logistic-regression-only-GCD-v2.0.pdf?dl=1\">,<\/a>\u201d Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, INFORMS Houston, October 2017<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/pxzk2tefrxu9rgc\/UIUC-logistic-regression-only-GCD-v2.0.pdf?dl=1\">Condition Number Analysis of Logistic Regression, and its Implications for First-Order Solution Methods,<\/a>\u201d Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, University of Illinois Urbana\/Champaign, September 2017.<\/p>\n<p><a href=\"http:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/30\/2017\/07\/27174236\/Morocco-logistic-regression.pdf\">\"Condition Number Analysis of Logistic Regression, and its Implications for First-Order Solution Methods,\u201d<\/a>\u00a0Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, ISI Marrakech, Morocco, July 2017.<\/p>\n<p><a href=\"https:\/\/www.dropbox.com\/s\/ikosmnkk96a4z9z\/Freund_Grigas_Mazumder_PT_vancouver-logistic-regression.pdf?dl=1\">\"New Results for Sparsity-inducing Methods for Logistic Regression,\" <\/a>Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, SIAM Conference on Optimization, Vancouver, CA, May 2017.<\/p>\n<p><a href=\"https:\/\/www.dropbox.com\/s\/bhoqr7ym3rehpad\/Freund_PT_2016_ExtendedFrankWolfe.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">\u201cAn Extended Frank-Wolfe Method, and its Application to Low-Rank Matrix Completion.\"<\/a>\u00a0Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, IEEE Conference on Decision and Control, Las Vegas, December 2016.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/2cx4ca29a7nwdm5\/Freund_PT_2016_cornell-logistic-regression.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">New Results for Sparsity-inducing Methods for Logistic Regression<\/a>.\" Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, Cornell University, Ithaca, NY. November 2016.<\/p>\n<p><a href=\"https:\/\/www.dropbox.com\/s\/no2953hh95k28dt\/Freund_PT_2016_NewComputational.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">\u201cNew Computational Guarantees for Solving Convex Optimization Problems with First Order Methods, via a Function Growth Condition Measure.\"<\/a>\u00a0Freund, Robert M., and Haihao Lu. Presentation, Continuous Optimization: Challenges and Applications, The Technion, Haifa, Israel. September 2016.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/e8m4kc44uyawsw5\/Freund_PT_2016_Tokyo_NewComputational.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">New Computational Guarantees for Solving Convex Optimization Problems with First Order Methods, via a Function Growth Condition Measure<\/a>.\" Freund, Robert, M., Haihao Lu. Presentation, \u00a0ICCOPT Tokyo, Japan. August 2016.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/qlas47tq6qe32n9\/Freund_PT_2016_NewPerspectivesPrinceton.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">A New Perspective on Boosting in Linear Regression via Subgradient Optimization and Relatives<\/a>\"\u00a0Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, Princeton University, Princeton, NJ. April 2016.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/9iwrsrcmq1w5c7n\/Freund_PT_2015_NewPerspectives.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">A New Perspective on Boosting in Linear Regression via Subradient Optimization and Relatives<\/a>.\"\u00a0Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation,\u00a0Computational and Methodological Statistics Conference, London, UK. December 2015.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/inwu6lsx68r3oui\/Freund_PT_2015_ExtendedFrankWolfe.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">An Extended Frank-Wolfe Method, and its\u00a0Application to Low-Rank Matrix Completion<\/a>.\"\u00a0Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, University of British Columbia, Vancouver, Canada. December 2015.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/3e0dbi9105q4gwn\/Freund_PT_2015_INFORMS.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">New Computational Guarantees for Solving Convex Optimization Problems with First Order Methods, via a Function Growth Condition Number<\/a>.\"\u00a0Freund, Robert M., and Haihao Lu. Presentation, INFORMS, Philadelphia, PA. November 2015.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/936p0frcsbvogsb\/Freund_PT_2015_FrankWolfe.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">An Extended Frank-Wolfe Method, and is Application to Low-Rank Matrix Completion<\/a>.\" Freund, Robert M. Presentation,\u00a0MIT Stochastics and Statistics Seminar, Cambridge, MA. September 2015.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/xf7et18uo6axie8\/Freund_PT_2015_RenegarISMP.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Extending Renegar's Recent Work: A Different\/Improved Analysis of Basic First-Order Methods in Convex Optimization<\/a>.\" Freund, Robert M. Presentation, ISMP, Pittsburg, PA. July 2015.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/5hq1q7v10j6yvem\/Freund_PT_2015_RenegarTam.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Extending Renegar's Recent Work: A Different\/Improved Analysis of Basic First-Order Methods for Conic Optimization<\/a>.\" Freund, Robert M. Presentation,\u00a0Optimization Conference in honor of Tamas Terlaky, HEC, Montreal, Canada. June 2015.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/h1bqnp95bw8lwim\/Freund_PT_2015_Lectures.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Lectures on Greedy-type Algorith in Convex Optimization<\/a>.\" Freund, Robert M. Presentation, University of Texas, Austin, Texas. November 13, 2015.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/u83lgopp9z306kf\/Freund_PT_2015_ExtendedFrank.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">An Extended Frank-Wolfe Method, with Applications to Low-Rank Matrix Completion<\/a>.\"\u00a0Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, INFORMS, San Francisco, CA. November 2014.<\/p>\n<p>\"<a href=\"https:\/\/www.dropbox.com\/s\/g3w4chrzisz6lcv\/Freund_PT_2014_MIKETODD.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Mike Todd: Moving Optimzation Forward<\/a>.\" Freund, Robert M. Presentation, Cornell University, Ithaca, NY. August 2014.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/y6mido52kp1oooo\/Freund_PT_2014_FIRSTOrder.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">First-Order Methods Yield New Analysis and Results for Boosting Methods in Statistics\/Machine Learning<\/a>.\" Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation, SIOPT Meeting, San Diego, CA. May 2014.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/1r84flm31zkqaxd\/Freund_PT_2014_FIRSTOrderMarch.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">A First-Order View of Some Boosting Methods: Computational Guarantees and Connections to Regularization<\/a>.\" Freund, Robert M., Paul Grigas, and Rahul Mazumder. Presentation,\u00a0Cornell University, Ithaca, NY. March 2014.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/x5rq1dvwpvr03ph\/Freund_PT_2013_Frank_Results.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">The Frank-Wolfe Algorithm: New Results, and Connections to Statistical Boosting<\/a>.\u201d Grigas, Paul, Robert Freund, and Rahul Mazumder. Presentation,\u00a0Workshop on Optimization and Big Data, University of Edinburgh, Scotland. May 2013.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/nay5bi6camyfp7k\/Freund_PT_2013_Optimizer.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">An Optimizer's View of Statistical Boosting Algorithms<\/a>.\u201d Freund, Robert, Paul Grigas, and Rahul Mazumder. Presentation,\u00a0ICHOI, Chilean Institute of Operations Research. April 2013.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/pnomj1iau9fd677\/Freund_PT_2013_Fabrication.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Fabrication-Adaptive Optimization, with an Application to Photonic Crystal Design<\/a>.\u201d Men, Han, Joel Saa-Seoane, Ngoc Cuong Nguyen, Robert M. Freund, and Jaime Peraire.\u00a0Georgia Institute of Technology. January 2013.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/tzgzxj2raqqn9ya\/Freund_PT_2012_Implementation.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Implementation-Robust Design: Modeling, Theory, and Application to Photonic Crystal Design with Bandgaps<\/a>.\u201d Men, Han, Joel Saa-Seoane, Ngoc Cuong Nguyen, Robert Freund, and Jaime Peraire. Presentation,\u00a0Sabanci University, Istanbul, Turkey. August 2012.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/k9srg87vx5a6f9z\/Freund_PT_2012_Illustrations.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Illustrations of Business Analytics and the 21st Century Industrial Revolution<\/a>.\" Freund, Robert M. Presentation, Sabanci University, Istanbul, Turkey.\u00a0October 2012.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/kr3w0asvxkgveqs\/Freund_PT_2012_Proximal.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Proximal Subgradient and Dual Averaging for Sequential Decision-making and Non-smooth Optimization<\/a>.\" Grigas, Paul, and Robert M. Freund. Presentation, ISMP, Berlin, Germany. August 2012.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/fl1u6ph0jilo1kz\/Freund_PT_2012_Implementation2.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Implementation-Robust Design: Modeling, Theory, and Application to Photonic Crystal Design with Bandgaps<\/a>.\u201dMen, Han, Joel Saa-Seoane, Ngoc Cuong Nguyen, Robert M. Freund, and Jaime Peraire. Presentation, ISMP, Berlin, Germany. August 2012.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/hzdtxvds30cdzf6\/Freund_PT_2012_Implementation-Robust.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Recent Research on Design Optimization of Wave Propagation in Metamaterials: Fabrication-Robust Design, and Binary Optimization with Reduced Basis<\/a>.\u201d Men, Han, Ngoc Cuong Nguyen, Joel Saa-Seoane, Robert M. Freund, and Jaime Peraire. Presentation,\u00a0AFOSR Optimization and Discrete Mathematics Program Review. April 2012.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/hzdtxvds30cdzf6\/Freund_PT_2012_Implementation-Robust.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Implementation-Robust Design: Modeling, Theory, and Application to Photonic Crystal Design with Multiple and Complete Bandgaps<\/a>.\u201d Men, Han, Ngoc Cuong Nguyen, Joel Saa-Seoane, Robert M. Freund, and Jaime Peraire. Presentation,\u00a0Catolica University, Santiago, Chile. March 2012.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/nspo5y82mg9qr09\/Freund_PT_2012_Bandgap.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Bandgap Optimization of Photonic Crystals via Semidefinite Programming and Subspace Methods.<\/a>\u201d Freund, Robert M., Han Men, Joel Saa-Seoane, Ngoc Cuong Nguyen, Pablo Parillo, and Jaime Peraire. Presentation,\u00a0Fields Institute Conference on Discrete Geometry and Optimization, Toronto, Canada, September 2011 and SIAM Conference on Optimization, Darmstadt, Germany. May 2011.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/1jobxi7aum92k6i\/Freund_PT_2011_DesignPhotonic.ppt?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Design of Photonic Crystals with Multiple and Combined Band Gaps, plus Fabrication-Robust Design<\/a>.\u201d Freund, Robert M., Han Men, Ngoc Cuong Nguyen, Pablo Parrilo, and Jaime Peraire. Presentation,\u00a0AFOSR. April 2011.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/2pv2sk3tw1d7ovb\/Freund_PT_2010_BandGap.ppt?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Band Gap Optimization of 2-Dimensional Photonic Crystals using Semi-Definite Programming and Subspace Methods<\/a>.\u201d Freund, Robert M., Han Men, Ngoc Cuong Nguyen, Pablo Parrilo, and Jaime Peraire. Presentation,\u00a0ICCOPT 2010, Santiago. July 2010.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/ri4q6feyji5q8el\/Freund_PT_2010_PrimalDual.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Primal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization<\/a>.\u201d Freund, Robert M. Presentation, Fields Institute, Toronto, Canada. June 2010.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/xk2jwhkyibf13c2\/Freund_PT_2009_Behavioral.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Behavioral Measures and their Correlation with IPM Iteration Counts on Semi-Definite Programming Problems<\/a>.\u201d Freund, Robert M., Fernando Ord\u00f3\u00f1e, and Kim-Chuan Toh. Presentation,\u00a0Cambridge University Judge School of Business, Cambridge, UK. November, 2009.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/z85x8gvzke1hgvp\/Freund_PT_2009_PrimalDual.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Primal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization<\/a>.\u201d Freund, Robert M., Presentation, ETH Zurich, Switzerland. November 2009.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/o3wy74qbxlfcv5s\/Freund_PT_2009_PrimalDual2.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">On the Primal-Dual Geometry of Level Sets in Linear and Conic Convex Optimization<\/a>.\u201d Freund, Robert M. Presentation, INFORMS Annual Meeting, San Diego, CA. October 2009.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/u3degpoz5h3nvc5\/Freund_PT_2009_Convex.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model<\/a>.\u201d Freund, Robert M., and Jorge Vera. Presentation, International Symposium on Mathematical Programming, Chicago, IL. August 2009.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/jw6q61x1ndmehju\/Freund_PT_2008_Improved.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Improved Initialization of the Homogeneous Self-Dual Embedding Model for Solving Conic Convex Optimization<\/a>.\u201d Belloni, Alexandre, Robert M. Freund, Kim-Chuan Toh, and Allison Chang. Presentation,\u00a0SIAM Conference on Optimization, Boston, MA. May 2008.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/vz7xe6spdfrldni\/Freund_PT_2007_DesigningDelivering.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Designing and Delivering a Better Management Science Course for MBA Students<\/a>.\u201d Freund, Robert M. Presentation, INFORMS Annual Meeting, Seattle, WA. November, 2007.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/b6x7xly0et94yfw\/Freund_PT_2007_Randomized.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Randomized Methods for Solving Convex Problems: Some Theory and Some Computational Experience<\/a>.\u201d Freund, Robert M., and Alexandre Belloni. Presentation. University of Southern California, Los Angeles, CA. October, 2007.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/l30e4uozig5m3za\/Freund_PT_2007_Projective.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Projective Re-Normalization for Improving the Performance of IPMs for Conic Optimization<\/a>.\u201d Belloni, Alexandre, and Robert M. Freund. Presentation,\u00a0ICCOPT-2, Hamilton, Canada. August, 2007.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/7jg1dpmdf4eyke2\/Freund_PT_2006_EffeicientRandomized.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">On Efficient Randomized Methods for Convex Optimization<\/a>.\u201d Freund, Robert M. Presentation, Banff International Research Station,\u00a0Banff, Canada. November 2006.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/9uc2kxc63xwvwu1\/Freund_PT_2006_Behavioral.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Behavioral Measures and their Correlation with IPM Iteration Counts on Semi-Definite Programming Problems<\/a>.\u201d Freund, Robert M., Fernando Ord\u00f3\u00f1ez, and Kim-Chuan Toh. Presentation,\u00a0Northwestern University, Evanstown, IL. October 2006.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/t26imoin4p4jokz\/Freund_PT_2006_EfficiencyBrazil.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Efficiency of a Re-scaled Perceptron Algorithm for Conic Systems<\/a>.\u201d Belloni, Alexandre, Robert M. Freund, and Santosh Vempala. Presentation,\u00a0International Symposium on Mathematical Programming, Rio de Janeiro, Brazil. August 2006.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/e3xbkppxcqyrof1\/Freund_PT_2006_EfficiencyRescaled.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Efficiency of a Re-scaled Perceptron Algorithm for Conic Systems<\/a>.\u201d Belloni, Alexandre, Robert M. Freund, and Santosh Vempala, 9th International Workshop on High Performance Optimization Techniques, Delft, The Netherlands. June 2006.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/zbwdg3dlxzoehd6\/Freund_PT_2006_Projective.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Projective Pre-Conditioners for Improving the Behavior of a Conic Inequality System<\/a>.\u201d Freund, Robert M., and Alexandre Belloni. Presentation, Cowles Foundation Conference on Optimization, Yale University, New Haven, CT. March 2006.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/si1qg948jtry0fw\/Freund_PT_2006_Projective2.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Projective Pre-Conditioners for Improving the Behavior of a Linear or Conic Inequality System<\/a>.\u201d Freund, Robert M., and Alexandre Belloni. Presentation,\u00a0MIT Mathematics Department Applied Mathematics Colloquium, Cambridge, MA. February 2006.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/8tzwpvro6jiuoag\/Freund_PT_2006_Reducing.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Reducing the Solution Time for Convex Optimization Problems by Pre-Conditioning Transformations<\/a>.\u201d Freund, Robert M., and Alexandre Belloni. Presentation,\u00a0Singapore-MIT Alliance Symposium, Singapore. January 2006.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/9gwkisdqj24cvjd\/Freund_PT_2005_Randomized.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Randomized Methods for (Continuous) Deterministic Optimization and Associated Complexity Analysis<\/a>.\u201d Freund, Robert M., and Alexandre Belloni. Presentation, Stanford University, Stanford, CA. October 2005.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/rug0h7jhg2yig8g\/Freund_PT_2005_Randomized2.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Randomized Methods for (Continuous) Deterministic Optimization and Associated Complexity Analysis<\/a>.\u201d Belloni, Alexandre, and Robert M. Freund. Presentation,\u00a0Foundations of Computational Mathematics, Santander, Spain. July 2005.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/kq26ve5nd821cev\/Freund_PT_2005_Projective.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Projective Pre-Conditioners for Improving the Behavior of a Homogeneous Conic Linear System<\/a>.\u201d Belloni, Alexandre, and Robert M. Freund. Presentation, SIAM Conference on Optimization, Stockholm, Sweden. May 2005.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/xg6vnzx5h9jmped\/Freund_PT_2005_Behavior.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization<\/a>.\u201d Freund, Robert M. Presentation,\u00a0SIAM Conference on Optimization, Stockholm, Sweden. May 2005.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/rlbqd3gaa9zznb8\/Freund_PT_2005_CausesVariability.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">On the Causes of Variability in IPM Iterations on Semi-Definite Programming Problems<\/a>.\u201d Freund, Robert M., Fernando Ord\u00f3\u00f1ez and Kim-Chuan Toh. Presentation,\u00a0SIAM Conference on Optimization, Stockholm, Sweden. May 2005.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/a5pxsarxmjj2f8j\/Freund_PT_2003_Symmetry.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">On the Symmetry Function of a Convex Set<\/a>.\u201d Belloni, Alexandre, and Robert M. Freund. Presentation, Workshop on Large Scale Nonlinear and Semidefinite Programming, University of Waterloo, Waterloo, Ontario. June 2004.<\/p>\n<p>\u201c<a href=\"https:\/\/www.dropbox.com\/s\/uhzacfi6nm65ms7\/Freund_PT_2003_ComputationalExperience.pdf?dl=1\" target=\"_blank\" rel=\"noopener noreferrer\">Computational Experience and the Explanatory Value of Condition Numbers for Linear Optimization<\/a>.\u201d Freund, Robert M., and Fernando Ord\u00f3\u00f1ez. Presentation, Lehigh University, Bethlehem, PA. April 2003.<\/p>\n<p id=\"jump-to-students\"><span style=\"color: #ffffff;\">_<\/span><\/p>\n<\/div><\/div><div id=\"panel-32-0-0-4\" class=\"so-panel widget widget_mit-pf-wysiwyg widget_mit_pf_wysiwyg panel-last-child\" data-index=\"4\" ><h2 class=\"widget-title\">Current and Former Students and Co-Authors<\/h2><div class=\"textwidget\"><ul>\n<li><a href=\"http:\/\/faculty.fuqua.duke.edu\/~abn5\/belloni-index.html\" target=\"_blank\" rel=\"noopener\">Alexandre Belloni<\/a><\/li>\n<li><a href=\"http:\/\/mitsloan.mit.edu\/faculty-and-research\/faculty-directory\/detail\/?id=41218\" target=\"_blank\" rel=\"noopener\">Dimitris Bertsimas<\/a><\/li>\n<li><a href=\"http:\/\/iems.northwestern.edu\/~jrbirge\/\" target=\"_blank\" rel=\"noopener\">John Birge<\/a><\/li>\n<li>Zhi Cai<\/li>\n<li><a href=\"https:\/\/bmi.inf.ethz.ch\/people\/person\/gideon-dresdner\/\">Gideon Dresdner<\/a><\/li>\n<li>Curtis Eaves<\/li>\n<li><a href=\"https:\/\/people.eecs.berkeley.edu\/~elghaoui\/\">Laurent El Ghaoui<\/a><\/li>\n<li><a href=\"http:\/\/www-personal.umich.edu\/~mepelman\/\" target=\"_blank\" rel=\"noopener\">Marina Epelman<\/a><\/li>\n<li><a href=\"http:\/\/mitsloan.mit.edu\/faculty-and-research\/faculty-directory\/detail\/?id=41254\" target=\"_blank\" rel=\"noopener\">Charles Fine<\/a><\/li>\n<li>Federico Girosi<\/li>\n<li><a href=\"https:\/\/grigas.ieor.berkeley.edu\/\">Paul Grigas<\/a><\/li>\n<li><a href=\"http:\/\/www.mit.edu\/~jourdain\/\">Jourdain Lamperski<\/a><\/li>\n<li><a href=\"https:\/\/bmi.inf.ethz.ch\/people\/person\/francesco-locatello\/\">Francesco Locatello<\/a><\/li>\n<li><a href=\"http:\/\/www.mit.edu\/~rahulmaz\/\" target=\"_blank\" rel=\"noopener\">Rahul Mazumder<\/a><\/li>\n<li>Abby Men<\/li>\n<li><a href=\"http:\/\/www.me.titech.ac.jp\/~mizu_lab\/indexe.html\" target=\"_blank\" rel=\"noopener\">Shinji Mizuno<\/a><\/li>\n<li><a href=\"https:\/\/people.csail.mit.edu\/mirrokni\/Welcome.html\">Vahab Mirrokni<\/a><\/li>\n<li><a href=\"https:\/\/uclouvain.be\/fr\/repertoires\/yurii.nesterov\">Yurii Nesterov<\/a><\/li>\n<li><a href=\"http:\/\/www.mit.edu\/~cuongng\/Site\/Home.html\" target=\"_blank\" rel=\"noopener\">Ngoc Cuong Nguyen<\/a><\/li>\n<li><a href=\"http:\/\/geoffreynegiar.com\/\">Geoffrey N\u00e8giar<\/a><\/li>\n<li><a href=\"http:\/\/admin.business.uconn.edu\/portalvbvs\/desktopmodules\/webmanager\/preview\/previewPage.aspx?pageid=461&amp;uid=215&amp;m=c&amp;rid=\" target=\"_blank\" rel=\"noopener\">Manuel Nunez<\/a><\/li>\n<li><a href=\"http:\/\/www-rcf.usc.edu\/~fordon\/\" target=\"_blank\" rel=\"noopener\">Fernando Ord\u00f3\u00f1ez<\/a><\/li>\n<li><a href=\"http:\/\/mitsloan.mit.edu\/faculty-and-research\/faculty-directory\/detail\/?id=15027\" target=\"_blank\" rel=\"noopener\">James Orlin<\/a><\/li>\n<li>Edgar Osuna<\/li>\n<li><a href=\"http:\/\/www.mit.edu\/~parrilo\" target=\"_blank\" rel=\"noopener\">Pablo Parrilo<\/a><\/li>\n<li><a href=\"http:\/\/fa.bianp.net\/pages\/about.html\">Fabian Pedregosa<\/a><\/li>\n<li><a href=\"http:\/\/aeroastro.mit.edu\/peraire\" target=\"_blank\" rel=\"noopener\">Jaime Peraire<\/a><\/li>\n<li><a href=\"http:\/\/legacy.orie.cornell.edu\/~robin\/\" target=\"_blank\" rel=\"noopener\">Robin Roundy<\/a><\/li>\n<li>Joel Saa-Seoane<\/li>\n<li><a href=\"http:\/\/www-bcf.usc.edu\/~selove\/\" target=\"_blank\" rel=\"noopener\">Matthew Selove<\/a><\/li>\n<li>Xu Sheng<\/li>\n<li><a href=\"http:\/\/mitsloan.mit.edu\/faculty-and-research\/faculty-directory\/detail\/?id=41381\" target=\"_blank\" rel=\"noopener\">Duncan Simester<\/a><\/li>\n<li><a href=\"http:\/\/www.fba.nus.edu.sg\/depart\/ds\/sunjiehomepage\/\" target=\"_blank\" rel=\"noopener\">Jie Sun<\/a><\/li>\n<li><a href=\"https:\/\/www.isye.gatech.edu\/users\/andy-sun\">Andy Sun<\/a><\/li>\n<li><a href=\"http:\/\/www.fuqua.duke.edu\/faculty\/alpha\/sun.htm\" target=\"_blank\" rel=\"noopener\">Peng Sun<\/a><\/li>\n<li><a href=\"https:\/\/bizfaculty.nus.edu.sg\/faculty-details\/?profId=239\" target=\"_blank\" rel=\"noopener\">Kok Choon Tan<\/a><\/li>\n<li><a href=\"http:\/\/www.orie.cornell.edu\/~miketodd\/todd.html\" target=\"_blank\" rel=\"noopener\">Michael Todd<\/a><\/li>\n<li><a href=\"http:\/\/www.math.nus.edu.sg\/~mattohkc\/\" target=\"_blank\" rel=\"noopener\">Kim Chuan Toh<\/a><\/li>\n<li>Alicia Yi-Ting Tsai<\/li>\n<li><a href=\"http:\/\/www.princeton.edu\/~rvdb\/\" target=\"_blank\" rel=\"noopener\">Robert Vanderbei<\/a><\/li>\n<li><a href=\"http:\/\/www.cc.gatech.edu\/~vempala\/\" target=\"_blank\" rel=\"noopener\">Santosh Vempala<\/a><\/li>\n<li><a href=\"http:\/\/www2.ing.puc.cl\/~jvera\/\" target=\"_blank\" rel=\"noopener\">Jorge Vera<\/a><\/li>\n<\/ul>\n<\/div><\/div><\/div><\/div><\/div>","protected":false},"excerpt":{"rendered":"<p>I support and stand with people who are not of my race \u2014 in the academic community and elsewhere \u2014 in protest against hate, brutality, divisiveness, fear, indifference, inequality, and discrimination. Publications Recent Talks Current and Former Students and Coauthors \u00a0_ PublicationsBooks Data, Models, and Decisions: The Fundamentals of Management Science, with Dimitris Bertsimas, Southwestern [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_exactmetrics_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":""},"class_list":["post-32","page","type-page","status-publish","hentry"],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v24.0 (Yoast SEO v25.8) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>MIT Sloan: Robert M. Freund | Research and Publications<\/title>\n<meta name=\"description\" content=\"Freund\u2019s research is in the area of large-scale mathematical models that optimize or improve the performance of management systems.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Pubs\/Talks\/Collaborators\" \/>\n<meta property=\"og:description\" content=\"Freund\u2019s research is in the area of large-scale mathematical models that optimize or improve the performance of management systems.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/\" \/>\n<meta property=\"og:site_name\" content=\"Robert M. Freund\" \/>\n<meta property=\"article:modified_time\" content=\"2025-09-03T18:50:46+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"21 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/\",\"url\":\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/\",\"name\":\"MIT Sloan: Robert M. Freund | Research and Publications\",\"isPartOf\":{\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/#website\"},\"datePublished\":\"2016-10-03T18:03:26+00:00\",\"dateModified\":\"2025-09-03T18:50:46+00:00\",\"description\":\"Freund\u2019s research is in the area of large-scale mathematical models that optimize or improve the performance of management systems.\",\"breadcrumb\":{\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Pubs\/Talks\/Collaborators\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/#website\",\"url\":\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/\",\"name\":\"Robert M. Freund\",\"description\":\"MIT Personal Faculty\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"MIT Sloan: Robert M. Freund | Research and Publications","description":"Freund\u2019s research is in the area of large-scale mathematical models that optimize or improve the performance of management systems.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/","og_locale":"en_US","og_type":"article","og_title":"Pubs\/Talks\/Collaborators","og_description":"Freund\u2019s research is in the area of large-scale mathematical models that optimize or improve the performance of management systems.","og_url":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/","og_site_name":"Robert M. Freund","article_modified_time":"2025-09-03T18:50:46+00:00","twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"21 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/","url":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/","name":"MIT Sloan: Robert M. Freund | Research and Publications","isPartOf":{"@id":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/#website"},"datePublished":"2016-10-03T18:03:26+00:00","dateModified":"2025-09-03T18:50:46+00:00","description":"Freund\u2019s research is in the area of large-scale mathematical models that optimize or improve the performance of management systems.","breadcrumb":{"@id":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/research-activities\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/"},{"@type":"ListItem","position":2,"name":"Pubs\/Talks\/Collaborators"}]},{"@type":"WebSite","@id":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/#website","url":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/","name":"Robert M. Freund","description":"MIT Personal Faculty","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"}]}},"_links":{"self":[{"href":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/wp-json\/wp\/v2\/pages\/32","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/wp-json\/wp\/v2\/comments?post=32"}],"version-history":[{"count":337,"href":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/wp-json\/wp\/v2\/pages\/32\/revisions"}],"predecessor-version":[{"id":1390,"href":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/wp-json\/wp\/v2\/pages\/32\/revisions\/1390"}],"wp:attachment":[{"href":"https:\/\/mitmgmtfaculty.mit.edu\/rfreund\/wp-json\/wp\/v2\/media?parent=32"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}