Robert M. Freund

Orcid: 0000-0002-1733-5363

According to our database1, Robert M. Freund authored at least 60 papers between 1981 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization.
SIAM J. Optim., 2024

An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities.
Math. Oper. Res., 2024

2023
Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier.
Math. Program., May, 2023

2021
Generalized stochastic Frank-Wolfe algorithm with stochastic "substitute" gradient for structured convex optimization.
Math. Program., 2021

2018
Accelerated Residual Methods for the Iterative Solution of Systems of Equations.
SIAM J. Sci. Comput., 2018

Relatively Smooth Convex Optimization by First-Order Methods, and Applications.
SIAM J. Optim., 2018

New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure.
Math. Program., 2018

Condition Number Analysis of Logistic Regression, and its Implications for Standard First-Order Solution Methods.
CoRR, 2018

Accelerating Greedy Coordinate Descent Methods.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
An Extended Frank-Wolfe Method with "In-Face" Directions, and Its Application to Low-Rank Matrix Completion.
SIAM J. Optim., 2017

2016
Functional Regression for State Prediction Using Linear PDE Models and Observations.
SIAM J. Sci. Comput., 2016

New analysis and results for the Frank-Wolfe method.
Math. Program., 2016

2015
A New Perspective on Boosting in Linear Regression via Subgradient Optimization and Relatives.
CoRR, 2015

2014
Fabrication-Adaptive Optimization with an Application to Photonic Crystal Design.
Oper. Res., 2014

2013
An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems.
Optim. Methods Softw., 2013

AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods.
CoRR, 2013

2010
Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods.
J. Comput. Phys., 2010

2009
A geometric analysis of Renegar's condition number, and its interplay with conic curvature.
Math. Program., 2009

Projective re-normalization for improving the behavior of a homogeneous conic linear system.
Math. Program., 2009

Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model.
Math. Oper. Res., 2009

An Efficient Rescaled Perceptron Algorithm for Conic Systems.
Math. Oper. Res., 2009

2008
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection.
SIAM J. Optim., 2008

On the symmetry function of a convex set.
Math. Program., 2008

Optimizing Product Line Designs: Efficient Methods and Comparisons.
Manag. Sci., 2008

2007
Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems.
Math. Program., 2007

An Efficient Re-scaled Perceptron Algorithm for Conic Systems.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
On the behavior of the homogeneous self-dual model for conic convex optimization.
Math. Program., 2006

On Two Measures of Problem Instance Complexity and their Correlation with the Performance of SeDuMi on Second-Order Cone Problems.
Comput. Optim. Appl., 2006

2005
On an Extension of Condition Number Theory to Nonconic Convex Optimization.
Math. Oper. Res., 2005

2004
Complexity of convex optimization using geometry-based measures and a reference point.
Math. Program., 2004

Computation of Minimum-Volume Covering Ellipsoids.
Oper. Res., 2004

Data, models, and decisions - the fundamentals of management science.
Dynamic Ideas, ISBN: 978-0-9759146-0-1, 2004

2003
Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization.
SIAM J. Optim., 2003

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

On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System.
Math. Oper. Res., 2003

Solution Methodologies for the Smallest Enclosing Circle Problem.
Comput. Optim. Appl., 2003

2002
A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems.
SIAM J. Optim., 2002

2001
Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program.
SIAM J. Optim., 2001

2000
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system.
Math. Program., 2000

1999
Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm.
SIAM J. Optim., 1999

Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system.
Math. Program., 1999

1998
Condition measures and properties of the central trajectory of a linear program.
Math. Program., 1998

1997
Training Support Vector Machines: an Application to Face Detection.
Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97), 1997

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

Preface.
Ann. Oper. Res., 1996

1995
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., 1995

Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables.
Math. Oper. Res., 1995

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

1992
Prior reduced fill-in in solving equations in interior point algorithms.
Oper. Res. Lett., 1992

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

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

A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming.
Math. Oper. Res., 1991

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

1987
Dual gauge programs, with applications to quadratic programming and the minimum-norm problem.
Math. Program., 1987

1986
Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube.
Math. Oper. Res., 1986

1985
On the complexity of four polyhedral set containment problems.
Math. Program., 1985

1984
Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology.
Math. Oper. Res., 1984

Variable Dimension Complexes Part I: Basic Theory.
Math. Oper. Res., 1984

1982
Optimal scaling of balls and polyhedra.
Math. Program., 1982

1981
A Constructive Proof of Tucker's Combinatorial Lemma.
J. Comb. Theory A, 1981


  Loading...