• Publications
  • Influence
SDPT3 -- A Matlab Software Package for Semidefinite Programming
This invention relates to stabilizing compositions; to the process for preparing a novel halogen-containing polymer; and to polymers stabilized against the deteriorative effect of heat whichExpand
  • 1,597
  • 146
Solving semidefinite-quadratic-linear programs using SDPT3
Abstract. This paper discusses computational experiments with linear optimization problems involving semidefinite, quadratic, and linear cone constraints (SQLPs). Many test problems of this type areExpand
  • 1,035
  • 109
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
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.Expand
  • 594
  • 96
Primal-Dual Interior-Point Methods for Self-Scaled Cones
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 andExpand
  • 506
  • 73
Distance-Weighted Discrimination
High-dimension low–sample size statistical analysis is becoming increasingly important in a wide range of applied contexts. In such situations, the popular support vector machine suffers from "dataExpand
  • 185
  • 23
Mathematical programming
  • M. J. Todd
  • Computer Science
  • Handbook of Discrete and Computational Geometry…
  • 1997
  • 391
  • 22
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
We describe several adaptive-step primal-dual interior point algorithms for linear programming. All have polynomial time complexity while some allow very long steps in favorable circumstances. WeExpand
  • 324
  • 21
On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
This software is designed to solve primal and dual semidefinite-quadratic-linear conic programming problems (known as SQLP problems) whose constraint conic is a product of semidefinite conics,Expand
  • 190
  • 21
On the Nesterov-Todd Direction in Semidefinite Programming
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 classExpand
  • 237
  • 20
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
We present an O√nL-iteration homogeneous and self-dual linear programming LP algorithm. The algorithm possesses the following features: • It solves the linear programming problem without anyExpand
  • 302
  • 17