#### Filter Results:

- Full text PDF available (65)

#### Publication Year

1974

2017

- This year (1)
- Last 5 years (14)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Key Phrases

#### Method

#### Organism

Learn More

- R. H. Tütüncü, K. C. Toh, M. J. Todd
- 2001

This document describes a new release, version 3.0, of the software SDPT3. This code is designed to solve conic programming problems whose constraint cone is a product of semidefinite cones, second-order cones, and/or nonnegative orthants. It employs a predictor-corrector primal-dual path-following method, with either the HKM or the NT search direction. The… (More)

- Reha H. Tütüncü, Kim-Chuan Toh, Michael J. Todd
- Math. Program.
- 2003

This paper discusses computational experiments with linear optimization problems involving semidefinite, quadratic, and linear cone constraints (SQLPs). Many test problems of this type are solved using a new release of SDPT3, a Matlab implementation of infeasible primal-dual path-following algorithms. The software developed by the authors uses Mehrotratype… (More)

- Yurii Nesterov, Michael J. Todd
- Math. Oper. Res.
- 1997

This paper provides a theoretical foundation for efficient interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled. For such problems we devise long-step and symmetric primal-dual methods. Because of the special properties of these cones and barriers, our algorithms can take… (More)

- Yurii Nesterov, Michael J. Todd
- SIAM Journal on Optimization
- 1998

In this paper we continue the development of a theoretical foundation for efficient primal-dual interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled (see [NT97]). The class of problems under consideration includes linear programming, semidefinite programming and convex… (More)

- Yinyu Ye, Michael J. Todd, Shinji Mizuno
- Math. Oper. Res.
- 1994

- Michael J. Todd, Kim-Chuan Toh, Reha H. Tütüncü
- SIAM Journal on Optimization
- 1998

We study different choices of search direction for primal-dual interior-point methods for semidefinite programming problems. One particular choice we consider comes from a specialization of a class of algorithms developed by Nesterov and Todd for certain convex programming problems. We discuss how the search directions for the Nesterov-Todd (NT) method can… (More)

- M J Todd
- 2001

Optimization problems in which the variable is not a vector but a symmetric matrix which is required to be positive semidefinite have been intensely studied in the last ten years. Part of the reason for the interest stems from the applicability of such problems to such diverse areas as designing the strongest column, checking the stability of a differential… (More)

- Shinji Mizuno, Michael J. Todd, Yinyu Ye
- Math. Oper. Res.
- 1993

Interior point methods were widely used in the past in the form of barrier methods. In linear programming, the simplex method dominated, mainly due to inefficiencies of barrier methods. Interior point methods became quit popular again after 1984, when Karmarkar announced a fast polynomial-time interior method for nonlinear programming [Karmarkar, 1984]. In… (More)

- S T Aw, T Haslwanter, G M Halmagyi, I S Curthoys, R A Yavor, M J Todd
- Journal of neurophysiology
- 1996

1. The kinematics of the human angular vestibuloocular reflex (VOR) in three dimensions was investigated in 12 normal subjects during high-acceleration head rotations (head "impulses"). A head impulse is a passive, unpredictable, high-acceleration (3,000-4,000 degrees/s2) head rotation of approximately 10-20 degrees in roll, pitch, or yaw, delivered with… (More)

- Michael J. Todd
- Operations Research
- 1990