Freund Robert M.

Robert M. Freund

Information about the author Robert M. Freund will soon be added to the site.
Found 13 papers in total
Computation of minimum-volume covering ellipsoids
Computation of minimum-volume covering ellipsoids
2004
We present a practical algorithm for computing the minimum-volume n -dimensional...
On the complexity of computing estimates of condition measures of a conic linear system
On the complexity of computing estimates of condition measures of a conic linear system
2003
Condition numbers based on the ‘distance to ill-posedness’ ρ( d ) have...
On an extension of condition number theory to nonconic convex optimization
On an extension of condition number theory to nonconic convex optimization
2005
The purpose of this paper is to extend, as much as possible, the modern theory of...
Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables
Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables
1995
This study examines two different barrier functions and their use in both...
Following a ‘balanced’ trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm
Following a ‘balanced’ trajectory from an infeasible point to an optimal linear programming solution with a polynomial-time algorithm
1996
This paper is concerned with the problem of following a trajectory from an infeasible...
Some characterizations and properties of the ‘distance to ill-posedness’ and the condition measure of a conic linear system
Some characterizations and properties of the ‘distance to ill-posedness’ and the condition measure of a conic linear system
1999
A conic linear system is a system of the form P(d): find x that solves b – Ax...
Condition measures and properties of the central trajectory of a linear program
Condition measures and properties of the central trajectory of a linear program
1998
Given a data instance d = (A,b,c) of a linear program, we show that certain properties...
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
1996
This paper presents an algorithm for solving a linear program LP (to a given...
Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
1993
The purpose of this study is to broaden the scope of projective transformation methods...
Prior reduced fill-in in solving equations in interior point algorithms
Prior reduced fill-in in solving equations in interior point algorithms
1992
The efficiency of interior-point algorithms for linear programming is related to the...
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
1991
This paper presents extensions and further analytical properties of algorithms for...
A method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programming
A method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programming
1991
Given a system of linear inequalities and equalities , where the right-hand sides are...
Optimal investment in product-flexible manufacturing capacity
Optimal investment in product-flexible manufacturing capacity
1990
This paper presents a model and an analysis of the cost-flexibility tradeoffs involved...
Papers per page: