Browsing by Author Freund, Robert Michael.

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 22  next >
Issue DateTitleAuthor(s)
1-Jun-2013A method for the parametric center problem, with a strictly monotone polynominal-time algorithm for linear programmingFreund, Robert Michael.; Tan, Kok-Choon.; Sloan School of Management.
1-Jun-2013A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start"Freund, Robert Michael.; Sloan School of Management.
1-Jun-2013An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytopeFreund, Robert Michael.; Sloan School of Management.
5-Jun-2013An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solutionFreund, Robert Michael.
1-Jun-2013Applications of a generalization of a set intersection theorem of Von NeumannFreund, Robert Michael.
1-Jun-2013Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variablesFreund, Robert Michael.; Todd, Michael J., 1947-
1-Jun-2013Combinatorial analogs of Brouwer's fixed point theorem on a bounded polyhedronFreund, Robert Michael.
1-Jun-2013Combinatorial theorems on the simplotope that generalize results on the simplex and cubeFreund, Robert Michael.; Sloan School of Management.
5-Jun-2013Condition measures and properties of the central trajectory of a linear programNunez, M. A. (Manuel A.); Freund, Robert Michael.; Massachusetts Institute of Technology. Operations Research Center.
1-Jun-2013Dual gauge programs, with applications to quadratic programming and the minimum-norm problemFreund, Robert Michael.
1-Jun-2013Economic analysis of product-flexible manufacturing system investment decisionsFine, Charles H.; Freund, Robert Michael.
1-Jun-2013Following a "balanced" trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithmFreund, Robert Michael.
1-Jun-2013Hidden minimum-norm problems in quadratic programmingFreund, Robert Michael.; Sloan School of Management.
1-Jun-2013Identifying the set of always-active constraints in a system of linear inequalities by a single linear programFreund, Robert Michael.; Roundy, Robin.; Todd, Michael J., 1947-
1-Jun-2013Implementation and combined empirical study of combined Phase I-Phase II potential reduction algorithm for linear programmingWadhwa, Hitendra K. S. (Hitendra Kumar Singh); Freund, Robert Michael.; Sloan School of Management.
5-Jun-2013Interior point methods : current status and future directionsFreund, Robert Michael.; Mizuno, Shinji.
1-Jun-2013Newton's method for the general parametric center problem with applicationsTan, Kok-Choon.; Freund, Robert Michael.; Sloan School of Management.
1-Jun-2013Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential functionFreund, Robert Michael.; Sloan School of Management.
1-Jun-2013Prior reduced fill-in in solving equations in interior point algorithmsBirge, John R.; Freund, Robert Michael.; Sloan School of Management.
1-Jun-2013Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problemFreund, Robert Michael.; Sloan School of Management.