Robert M. Freund

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 13

Top Topics

Semidefinite Program

Linear Inequalities

Top Venues

SIAM J. Sci. Comput.

Publications

Jourdain B. Lamperski, Robert M. Freund, Michael J. Todd
An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities. Math. Oper. Res. 49 (1) (2024)
Zikai Xiong, Robert M. Freund
Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization. SIAM J. Optim. 34 (3) (2024)
Renbo Zhao, Robert M. Freund
Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier. Math. Program. 199 (1) (2023)
Zikai Xiong, Robert M. Freund
Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization. CoRR (2022)
Haihao Lu, Robert M. Freund
Generalized stochastic Frank-Wolfe algorithm with stochastic "substitute" gradient for structured convex optimization. Math. Program. 187 (1) (2021)
Ngoc Cuong Nguyen, Pablo Fernández, Robert M. Freund, Jaime Peraire
Accelerated Residual Methods for the Iterative Solution of Systems of Equations. SIAM J. Sci. Comput. 40 (5) (2018)
Haihao Lu, Robert M. Freund, Yurii E. Nesterov
Relatively Smooth Convex Optimization by First-Order Methods, and Applications. SIAM J. Optim. 28 (1) (2018)
Haihao Lu, Robert M. Freund, Vahab S. Mirrokni
Accelerating Greedy Coordinate Descent Methods. ICML (2018)
Robert M. Freund, Paul Grigas, Rahul Mazumder
Condition Number Analysis of Logistic Regression, and its Implications for Standard First-Order Solution Methods. CoRR (2018)
Robert M. Freund, Haihao Lu
New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure. Math. Program. 170 (2) (2018)
Robert M. Freund, Paul Grigas, Rahul Mazumder
An Extended Frank-Wolfe Method with "In-Face" Directions, and Its Application to Low-Rank Matrix Completion. SIAM J. Optim. 27 (1) (2017)
Ngoc Cuong Nguyen, Han Men, Robert M. Freund, Jaume Peraire
Functional Regression for State Prediction Using Linear PDE Models and Observations. SIAM J. Sci. Comput. 38 (2) (2016)
Robert M. Freund, Paul Grigas
New analysis and results for the Frank-Wolfe method. Math. Program. 155 (1-2) (2016)
Robert M. Freund, Paul Grigas, Rahul Mazumder
A New Perspective on Boosting in Linear Regression via Subgradient Optimization and Relatives. CoRR (2015)
Han Men, Robert M. Freund, Ngoc Cuong Nguyen, Joel Saà-Seoane, Jaime Peraire
Fabrication-Adaptive Optimization with an Application to Photonic Crystal Design. Oper. Res. 62 (2) (2014)
Dimitris Bertsimas, Robert M. Freund, Xu Andy Sun
An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems. Optim. Methods Softw. 28 (3) (2013)
Robert M. Freund, Paul Grigas, Rahul Mazumder
AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods. CoRR (2013)
Han Men, Ngoc Cuong Nguyen, Robert M. Freund, Pablo A. Parrilo, Jaume Peraire
Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods. J. Comput. Phys. 229 (10) (2010)
Alexandre Belloni, Robert M. Freund, Santosh S. Vempala
An Efficient Rescaled Perceptron Algorithm for Conic Systems. Math. Oper. Res. 34 (3) (2009)
Alexandre Belloni, Robert M. Freund
A geometric analysis of Renegar's condition number, and its interplay with conic curvature. Math. Program. 119 (1) (2009)
Robert M. Freund, Jorge R. Vera
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model. Math. Oper. Res. 34 (4) (2009)
Alexandre Belloni, Robert M. Freund
Projective re-normalization for improving the behavior of a homogeneous conic linear system. Math. Program. 118 (2) (2009)
Alexandre Belloni, Robert M. Freund
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection. SIAM J. Optim. 19 (3) (2008)
Alexandre Belloni, Robert M. Freund, Matthew Selove, Duncan Simester
Optimizing Product Line Designs: Efficient Methods and Comparisons. Manag. Sci. 54 (9) (2008)
Alexandre Belloni, Robert M. Freund
On the symmetry function of a convex set. Math. Program. 111 (1-2) (2008)
Robert M. Freund, Fernando Ordóñez, Kim-Chuan Toh
Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems. Math. Program. 109 (2-3) (2007)
Alexandre Belloni, Robert M. Freund, Santosh S. Vempala
An Efficient Re-scaled Perceptron Algorithm for Conic Systems. COLT (2007)
Robert M. Freund
On the behavior of the homogeneous self-dual model for conic convex optimization. Math. Program. 106 (3) (2006)
Zhi Cai, Robert M. Freund
On Two Measures of Problem Instance Complexity and their Correlation with the Performance of SeDuMi on Second-Order Cone Problems. Comput. Optim. Appl. 34 (3) (2006)
Robert M. Freund, Fernando Ordóñez
On an Extension of Condition Number Theory to Nonconic Convex Optimization. Math. Oper. Res. 30 (1) (2005)
Peng Sun, Robert M. Freund
Computation of Minimum-Volume Covering Ellipsoids. Oper. Res. 52 (5) (2004)
Robert M. Freund
Complexity of convex optimization using geometry-based measures and a reference point. Math. Program. 99 (2) (2004)
Robert M. Freund
On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization. SIAM J. Optim. 13 (4) (2003)
Fernando Ordóñez, Robert M. Freund
Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization. SIAM J. Optim. 14 (2) (2003)
Robert M. Freund, Jorge R. Vera
On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System. Math. Oper. Res. 28 (4) (2003)
Sheng Xu, Robert M. Freund, Jie Sun
Solution Methodologies for the Smallest Enclosing Circle Problem. Comput. Optim. Appl. 25 (1-3) (2003)
Marina A. Epelman, Robert M. Freund
A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems. SIAM J. Optim. 12 (3) (2002)
Manuel Núñez, Robert M. Freund
Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program. SIAM J. Optim. 11 (3) (2001)
Marina A. Epelman, Robert M. Freund
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. Math. Program. 88 (3) (2000)
Robert M. Freund, Jorge R. Vera
Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm. SIAM J. Optim. 10 (1) (1999)
Robert M. Freund, Jorge R. Vera
Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system. Math. Program. 86 (2) (1999)
Manuel Núñez, Robert M. Freund
Condition measures and properties of the central trajectory of a linear program. Math. Program. 83 (1998)
Kurt M. Anstreicher, Robert M. Freund
Preface. Ann. Oper. Res. 62 (1) (1996)
Robert M. Freund
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution. Ann. Oper. Res. 62 (1) (1996)
Robert M. Freund
A Potential Reduction Algorithm with User-Specified Phase I-Phase II Balance for Solving a Linear Program from an Infeasible Warm Start. SIAM J. Optim. 5 (2) (1995)
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) (1995)
Robert M. Freund
Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem. Math. Program. 58 (1993)
John R. Birge, Robert M. Freund, Robert J. Vanderbei
Prior reduced fill-in in solving equations in interior point algorithms. Oper. Res. Lett. 11 (4) (1992)
Robert M. Freund, Kok-Choon Tan
A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming. Math. Oper. Res. 16 (4) (1991)
Robert M. Freund
A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start". Math. Program. 52 (1991)
Robert M. Freund
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function. Math. Program. 51 (1991)
Robert M. Freund
Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron. J. Comb. Theory, Ser. B 47 (2) (1989)
Robert M. Freund
Dual gauge programs, with applications to quadratic programming and the minimum-norm problem. Math. Program. 38 (1) (1987)
Robert M. Freund
Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube. Math. Oper. Res. 11 (1) (1986)
Robert M. Freund, James B. Orlin
On the complexity of four polyhedral set containment problems. Math. Program. 33 (2) (1985)
Robert M. Freund
Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology. Math. Oper. Res. 9 (4) (1984)
Robert M. Freund
Variable Dimension Complexes Part I: Basic Theory. Math. Oper. Res. 9 (4) (1984)
B. Curtis Eaves, Robert M. Freund
Optimal scaling of balls and polyhedra. Math. Program. 23 (1) (1982)
Robert M. Freund, Michael J. Todd
A Constructive Proof of Tucker's Combinatorial Lemma. J. Comb. Theory, Ser. A 30 (3) (1981)