default search action
Robert M. Freund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j53]Jourdain B. Lamperski
, Robert M. Freund
An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities. Math. Oper. Res. 49(1): 204-231 (2024) - [j52]Zikai Xiong
Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization. SIAM J. Optim. 34(3): 2503-2534 (2024) - 2023
- [j51]Renbo Zhao
Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier. Math. Program. 199(1): 123-163 (2023) - 2022
- [i4]Zikai Xiong, Robert M. Freund:
Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization. CoRR abs/2208.13933 (2022) - 2021
- [j50]Haihao Lu
Generalized stochastic Frank-Wolfe algorithm with stochastic "substitute" gradient for structured convex optimization. Math. Program. 187(1): 317-349 (2021)
2010 – 2019
- 2018
- [j49]Robert M. Freund
New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure. Math. Program. 170(2): 445-477 (2018) - [j48]Haihao Lu, Robert M. Freund, Yurii E. Nesterov:
Relatively Smooth Convex Optimization by First-Order Methods, and Applications. SIAM J. Optim. 28(1): 333-354 (2018) - [j47]Ngoc Cuong Nguyen
Accelerated Residual Methods for the Iterative Solution of Systems of Equations. SIAM J. Sci. Comput. 40(5): A3157-A3179 (2018) - [c3]Haihao Lu, Robert M. Freund, Vahab S. Mirrokni:
Accelerating Greedy Coordinate Descent Methods. ICML 2018: 3263-3272 - [i3]Robert M. Freund, Paul Grigas, Rahul Mazumder:
Condition Number Analysis of Logistic Regression, and its Implications for Standard First-Order Solution Methods. CoRR abs/1810.08727 (2018) - 2017
- [j46]Robert M. Freund, Paul Grigas
An Extended Frank-Wolfe Method with "In-Face" Directions, and Its Application to Low-Rank Matrix Completion. SIAM J. Optim. 27(1): 319-346 (2017) - 2016
- [j45]Robert M. Freund, Paul Grigas
New analysis and results for the Frank-Wolfe method. Math. Program. 155(1-2): 199-230 (2016) - [j44]Ngoc Cuong Nguyen
Functional Regression for State Prediction Using Linear PDE Models and Observations. SIAM J. Sci. Comput. 38(2) (2016) - 2015
- [i2]Robert M. Freund, Paul Grigas, Rahul Mazumder:
A New Perspective on Boosting in Linear Regression via Subgradient Optimization and Relatives. CoRR abs/1505.04243 (2015) - 2014
- [j43]Han Men, Robert M. Freund, Ngoc Cuong Nguyen
Fabrication-Adaptive Optimization with an Application to Photonic Crystal Design. Oper. Res. 62(2): 418-434 (2014) - 2013
- [j42]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): 424-441 (2013) - [i1]Robert M. Freund, Paul Grigas, Rahul Mazumder:
AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods. CoRR abs/1307.1192 (2013) - 2010
- [j41]Han Men, Ngoc Cuong Nguyen
Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods. J. Comput. Phys. 229(10): 3706-3725 (2010)
2000 – 2009
- 2009
- [j40]Alexandre Belloni, Robert M. Freund, Santosh S. Vempala:
An Efficient Rescaled Perceptron Algorithm for Conic Systems. Math. Oper. Res. 34(3): 621-641 (2009) - [j39]Robert M. Freund, Jorge R. Vera:
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model. Math. Oper. Res. 34(4): 869-879 (2009) - [j38]Alexandre Belloni, Robert M. Freund:
Projective re-normalization for improving the behavior of a homogeneous conic linear system. Math. Program. 118(2): 279-299 (2009) - [j37]Alexandre Belloni, Robert M. Freund:
A geometric analysis of Renegar's condition number, and its interplay with conic curvature. Math. Program. 119(1): 95-107 (2009) - 2008
- [j36]Alexandre Belloni, Robert M. Freund, Matthew Selove, Duncan Simester:
Optimizing Product Line Designs: Efficient Methods and Comparisons. Manag. Sci. 54(9): 1544-1552 (2008) - [j35]Alexandre Belloni, Robert M. Freund:
On the symmetry function of a convex set. Math. Program. 111(1-2): 57-93 (2008) - [j34]Alexandre Belloni, Robert M. Freund:
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection. SIAM J. Optim. 19(3): 1073-1092 (2008) - 2007
- [j33]Robert M. Freund, Fernando Ordóñez
Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems. Math. Program. 109(2-3): 445-475 (2007) - [c2]Alexandre Belloni, Robert M. Freund, Santosh S. Vempala:
An Efficient Re-scaled Perceptron Algorithm for Conic Systems. COLT 2007: 393-408 - 2006
- [j32]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): 299-319 (2006) - [j31]Robert M. Freund:
On the behavior of the homogeneous self-dual model for conic convex optimization. Math. Program. 106(3): 527-545 (2006) - 2005
- [j30]Robert M. Freund, Fernando Ordóñez
On an Extension of Condition Number Theory to Nonconic Convex Optimization. Math. Oper. Res. 30(1): 173-194 (2005) - 2004
- [b1]Dimitris Bertsimas, Robert M. Freund:
Data, models, and decisions - the fundamentals of management science. Dynamic Ideas 2004, ISBN 978-0-9759146-0-1, pp. I-XIX, 1-530 - [j29]Peng Sun, Robert M. Freund:
Computation of Minimum-Volume Covering Ellipsoids. Oper. Res. 52(5): 690-706 (2004) - [j28]Robert M. Freund:
Complexity of convex optimization using geometry-based measures and a reference point. Math. Program. 99(2): 197-221 (2004) - 2003
- [j27]Sheng Xu, Robert M. Freund, Jie Sun
Solution Methodologies for the Smallest Enclosing Circle Problem. Comput. Optim. Appl. 25(1-3): 283-292 (2003) - [j26]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): 625-648 (2003) - [j25]Robert M. Freund:
On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization. SIAM J. Optim. 13(4): 1004-1013 (2003) - [j24]Fernando Ordóñez
Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization. SIAM J. Optim. 14(2): 307-333 (2003) - 2002
- [j23]Marina A. Epelman
A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems. SIAM J. Optim. 12(3): 627-655 (2002) - 2001
- [j22]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): 818-836 (2001) - 2000
- [j21]Marina A. Epelman
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. Math. Program. 88(3): 451-485 (2000)
1990 – 1999
- 1999
- [j20]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): 225-260 (1999) - [j19]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): 155-176 (1999) - 1998
- [j18]Manuel Núñez
Condition measures and properties of the central trajectory of a linear program. Math. Program. 83: 1-28 (1998) - 1997
- [c1]Edgar Osuna, Robert M. Freund, Federico Girosi:
Training Support Vector Machines: an Application to Face Detection. CVPR 1997: 130-136 - 1996
- [j17]Kurt M. Anstreicher, Robert M. Freund:
Preface. Ann. Oper. Res. 62(1) (1996) - [j16]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): 29-57 (1996) - 1995
- [j15]Robert M. Freund, Michael J. Todd:
Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables. Math. Oper. Res. 20(2): 415-440 (1995) - [j14]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): 247-268 (1995) - 1993
- [j13]Robert M. Freund:
Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem. Math. Program. 58: 385-414 (1993) - 1992
- [j12]John R. Birge
Prior reduced fill-in in solving equations in interior point algorithms. Oper. Res. Lett. 11(4): 195-198 (1992) - 1991
- [j11]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): 775-801 (1991) - [j10]Robert M. Freund:
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function. Math. Program. 51: 203-222 (1991) - [j9]Robert M. Freund:
A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start". Math. Program. 52: 441-466 (1991)
1980 – 1989
- 1989
- [j8]Robert M. Freund:
Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron. J. Comb. Theory B 47(2): 192-219 (1989) - 1987
- [j7]Robert M. Freund:
Dual gauge programs, with applications to quadratic programming and the minimum-norm problem. Math. Program. 38(1): 47-67 (1987) - 1986
- [j6]Robert M. Freund:
Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube. Math. Oper. Res. 11(1): 169-179 (1986) - 1985
- [j5]Robert M. Freund, James B. Orlin
On the complexity of four polyhedral set containment problems. Math. Program. 33(2): 139-145 (1985) - 1984
- [j4]Robert M. Freund:
Variable Dimension Complexes Part I: Basic Theory. Math. Oper. Res. 9(4): 479-497 (1984) - [j3]Robert M. Freund:
Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology. Math. Oper. Res. 9(4): 498-509 (1984) - 1982
- [j2]B. Curtis Eaves, Robert M. Freund:
Optimal scaling of balls and polyhedra. Math. Program. 23(1): 138-147 (1982) - 1981
- [j1]Robert M. Freund, Michael J. Todd:
A Constructive Proof of Tucker's Combinatorial Lemma. J. Comb. Theory A 30(3): 321-325 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: