Browsing by Author Freund, Robert M.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 20 of 30  next >
Issue DateTitleAuthor(s)
9-Oct-2013A method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programmingFreund, Robert M.; Tan, Kok-Choon; Massachusetts Institute of Technology. Operations Research Center
9-Oct-2013A Potential Reduction Algorithm With User-Specified Phase I - Phase II Balance, for Solving a Linear Program from an Infeasible Warm Start-
9-Oct-2013A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start"Freund, Robert M.
9-Oct-2013An Algorithm for Computing the Symmetry Point of a Polytope-
9-Oct-2013An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytopeFreund, Robert M.; Massachusetts Institute of Technology. Operations Research Center
9-Oct-2013Complexity of convex optimization using geometry-based measures and a reference pointFreund, Robert M.
9-Oct-2013Computation of Minimum Volume Covering Ellipsoids-
5-Jun-2013Computational Experience and the Explanatory Value of Condition Numbers for Linear Optimization-
9-Oct-2013Computational experience and the explanatory value of condition numbers for linear optimizationOrdóñez, Fernando, 1970-; Freund, Robert M.
9-Oct-2013Condition measures and properties of the central trajectory of a linear programNunez, Manuel A.; Freund, Robert M.; Massachusetts Institute of Technology. Operations Research Center
9-Oct-2013Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear systemEpelman, Marina A., 1973-; Freund, Robert M.; Massachusetts Institute of Technology. Operations Research Center
9-Oct-2013Condition number complexity of an elementary algorithm for resolving a conic linear systemEpelman, Marina A., 1973-; Freund, Robert M.
9-Oct-2013Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithmFreund, Robert M.; Vera, Jorge R.; Massachusetts Institute of Technology. Operations Research Center
9-Oct-2013Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semi-Definete Program-
9-Oct-2013Interior point methods : current status and future directionsFreund, Robert M.; Mizuno, Shinji
9-Oct-2013Newton's method for the general parametric center problem with applicationsTan, Kok-Choon; Freund, Robert M.
9-Oct-2013On an Extension of Condition Number Theory to Non-Conic Convex Optimization-
9-Oct-2013On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization-
9-Oct-2013On Two Measures of Problem Instance Complexity and Their Correlation with the Performance of SeDuMi on Second-Order Cone Problems-
9-Oct-2013Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential functionFreund, Robert M.; Massachusetts Institute of Technology. Operations Research Center