Todd M.J.

M.J. Todd

Information about the author M.J. Todd will soon be added to the site.
Found 10 papers in total
Asymptotic behavior of interior-point methods: A view from semi-infinite programming
Asymptotic behavior of interior-point methods: A view from semi-infinite programming
1996
We study the asymptotic behavior of interior-point methods for linear programming...
Solving semidefinite–quadratic–linear programs using SDPT3
Solving semidefinite–quadratic–linear programs using SDPT3
2003
This paper discusses computational experiments with linear optimization problems...
Self-scaled barriers and interior-point methods for convex programming
Self-scaled barriers and interior-point methods for convex programming
1997
This paper provides a theoretical foundation for efficient interior-point algorithms...
The many facets of linear programming
The many facets of linear programming
2002
We examine the history of linear programming from computational, geometric and...
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
2001
This note studies -->χ --> A , a condition number used in the linear programming...
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
2001
We analyze perturbations of the right-hand side and the cost parameters in linear...
On two homogeneous self-dual approaches to linear programming and its extensions
On two homogeneous self-dual approaches to linear programming and its extensions
2001
We investigate the relation between interior-point algorithms applied to two...
Least-change quasi-Newton updates for equality-constrained optimization
Least-change quasi-Newton updates for equality-constrained optimization
2000
This paper investigates quasi-Newton updates for equality-constrained optimization....
Infeasible-start primal–dual methods and infeasibility detectors for nonlinear programming problems
Infeasible-start primal–dual methods and infeasibility detectors for nonlinear programming problems
1999
In this paper we present several ‘infeasible-start’ path-following and...
Todd’s low-complexity algorithm is a predictor-corrector path-following method
Todd’s low-complexity algorithm is a predictor-corrector path-following method
1992
The authors show that Todd’s low-complexity algorithm for linear programming...
Papers per page: