A Constructive Proof of Tucker's Combinatorial Lemma. - Robert M. Freund; Michael J. Todd (J. Comb. Theory A, 1981)

Optimal scaling of balls and polyhedra. - B. Curtis Eaves; Robert M. Freund (Math. Program., 1982)

Variable Dimension Complexes Part I: Basic Theory. - Robert M. Freund (Math. Oper. Res., 1984)

Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology. - Robert M. Freund (Math. Oper. Res., 1984)

On the complexity of four polyhedral set containment problems. - Robert M. Freund; James B. Orlin (Math. Program., 1985)

Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube. - Robert M. Freund (Math. Oper. Res., 1986)

Dual gauge programs, with applications to quadratic programming and the minimum-norm problem. - Robert M. Freund (Math. Program., 1987)

Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron. - Robert M. Freund (J. Comb. Theory B, 1989)

A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming. - Robert M. Freund; Kok-Choon Tan (Math. Oper. Res., 1991)

Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function. - Robert M. Freund (Math. Program., 1991)

A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start". - Robert M. Freund (Math. Program., 1991)

Prior reduced fill-in in solving equations in interior point algorithms. - John R. Birge; Robert M. Freund; Robert J. Vanderbei (Oper. Res. Lett., 1992)

Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem. - Robert M. Freund (Math. Program., 1993)

Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables. - Robert M. Freund; Michael J. Todd (Math. Oper. Res., 1995)

A Potential Reduction Algorithm with User-Specified Phase I-Phase II Balance for Solving a Linear Program from an Infeasible Warm Start. - Robert M. Freund (SIAM J. Optim., 1995)

Preface. - Kurt M. Anstreicher; Robert M. Freund (Ann. Oper. Res., 1996)

An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution. - Robert M. Freund (Ann. Oper. Res., 1996)

Training Support Vector Machines: an Application to Face Detection. - Edgar Osuna; Robert M. Freund; Federico Girosi (CVPR, 1997)

Condition measures and properties of the central trajectory of a linear program. - Manuel Núñez 001; Robert M. Freund (Math. Program., 1998)

Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system. - Robert M. Freund; Jorge R. Vera (Math. Program., 1999)

Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm. - Robert M. Freund; Jorge R. Vera (SIAM J. Optim., 1999)

Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. - Marina A. Epelman; Robert M. Freund (Math. Program., 2000)

Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program. - Manuel Núñez 001; Robert M. Freund (SIAM J. Optim., 2001)

A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems. - Marina A. Epelman; Robert M. Freund (SIAM J. Optim., 2002)

Solution Methodologies for the Smallest Enclosing Circle Problem. - Sheng Xu; Robert M. Freund; Jie Sun 001 (Comput. Optim. Appl., 2003)

On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System. - Robert M. Freund; Jorge R. Vera (Math. Oper. Res., 2003)

On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization. - Robert M. Freund (SIAM J. Optim., 2003)

Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization. - Fernando Ordóñez; Robert M. Freund (SIAM J. Optim., 2003)

Data, models, and decisions - the fundamentals of management science. - Dimitris Bertsimas; Robert M. Freund (Dynamic Ideas, 2004)

Computation of Minimum-Volume Covering Ellipsoids. - Peng Sun 001; Robert M. Freund (Oper. Res., 2004)

Complexity of convex optimization using geometry-based measures and a reference point. - Robert M. Freund (Math. Program., 2004)

On an Extension of Condition Number Theory to Nonconic Convex Optimization. - Robert M. Freund; Fernando Ordóñez (Math. Oper. Res., 2005)

On Two Measures of Problem Instance Complexity and their Correlation with the Performance of SeDuMi on Second-Order Cone Problems. - Zhi Cai; Robert M. Freund (Comput. Optim. Appl., 2006)

On the behavior of the homogeneous self-dual model for conic convex optimization. - Robert M. Freund (Math. Program., 2006)

An Efficient Re-scaled Perceptron Algorithm for Conic Systems. - Alexandre Belloni; Robert M. Freund; Santosh S. Vempala (COLT, 2007)

Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems. - Robert M. Freund; Fernando Ordóñez; Kim-Chuan Toh (Math. Program., 2007)

Optimizing Product Line Designs: Efficient Methods and Comparisons. - Alexandre Belloni; Robert M. Freund; Matthew Selove; Duncan Simester (Manag. Sci., 2008)

On the symmetry function of a convex set. - Alexandre Belloni; Robert M. Freund (Math. Program., 2008)

On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection. - Alexandre Belloni; Robert M. Freund (SIAM J. Optim., 2008)

An Efficient Rescaled Perceptron Algorithm for Conic Systems. - Alexandre Belloni; Robert M. Freund; Santosh S. Vempala (Math. Oper. Res., 2009)

Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model. - Robert M. Freund; Jorge R. Vera (Math. Oper. Res., 2009)

Projective re-normalization for improving the behavior of a homogeneous conic linear system. - Alexandre Belloni; Robert M. Freund (Math. Program., 2009)

A geometric analysis of Renegar's condition number, and its interplay with conic curvature. - Alexandre Belloni; Robert M. Freund (Math. Program., 2009)

Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods. - Han Men; Ngoc Cuong Nguyen; Robert M. Freund; Pablo A. Parrilo; Jaume Peraire (J. Comput. Phys., 2010)

AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods. - Robert M. Freund; Paul Grigas; Rahul Mazumder (CoRR, 2013)

An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems. - Dimitris Bertsimas; Robert M. Freund; Xu Andy Sun (Optim. Methods Softw., 2013)

Fabrication-Adaptive Optimization with an Application to Photonic Crystal Design. - Han Men; Robert M. Freund; Ngoc Cuong Nguyen; Joel Saà-Seoane; Jaime Peraire (Oper. Res., 2014)

A New Perspective on Boosting in Linear Regression via Subgradient Optimization and Relatives. - Robert M. Freund; Paul Grigas; Rahul Mazumder (CoRR, 2015)

New analysis and results for the Frank-Wolfe method. - Robert M. Freund; Paul Grigas (Math. Program., 2016)

Functional Regression for State Prediction Using Linear PDE Models and Observations. - Ngoc Cuong Nguyen; Han Men; Robert M. Freund; Jaume Peraire (SIAM J. Sci. Comput., 2016)

An Extended Frank-Wolfe Method with "In-Face" Directions, and Its Application to Low-Rank Matrix Completion. - Robert M. Freund; Paul Grigas; Rahul Mazumder (SIAM J. Optim., 2017)

Accelerating Greedy Coordinate Descent Methods. - Haihao Lu; Robert M. Freund; Vahab S. Mirrokni (ICML, 2018)

Condition Number Analysis of Logistic Regression, and its Implications for Standard First-Order Solution Methods. - Robert M. Freund; Paul Grigas; Rahul Mazumder (CoRR, 2018)

New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure. - Robert M. Freund; Haihao Lu (Math. Program., 2018)

Relatively Smooth Convex Optimization by First-Order Methods, and Applications. - Haihao Lu; Robert M. Freund; Yurii E. Nesterov (SIAM J. Optim., 2018)

Accelerated Residual Methods for the Iterative Solution of Systems of Equations. - Ngoc Cuong Nguyen; Pablo Fernández 002; Robert M. Freund; Jaime Peraire (SIAM J. Sci. Comput., 2018)

Generalized stochastic Frank-Wolfe algorithm with stochastic "substitute" gradient for structured convex optimization. - Haihao Lu; Robert M. Freund (Math. Program., 2021)

Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier. - Renbo Zhao; Robert M. Freund (Math. Program., 2023)

An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities. - Jourdain B. Lamperski; Robert M. Freund; Michael J. Todd (Math. Oper. Res., 2024)

Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization. - Zikai Xiong; Robert M. Freund (SIAM J. Optim., 2024)

Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses. - Shuvomoy Das Gupta; Robert M. Freund; Xu Andy Sun; Adrien Taylor (Math. Program., 2025)