#### Filter Results:

- Full text PDF available (57)

#### Publication Year

1996

2018

- This year (12)
- Last 5 years (34)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn 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â€¦ (More)

- Pratik Biswas, Tzu-Chen Liang, Kim-Chuan Toh, Yinyu Ye, Ta-Chung Wang
- IEEE Transactions on Automation Science andâ€¦
- 2006

A sensor network localization problem is to determine the positions of the sensor nodes in a network given incomplete and inaccurate pairwise distance measurements. Such distance data may be acquiredâ€¦ (More)

- 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â€¦ (More)

- Xin-Yuan Zhao, Defeng Sun, Kim-Chuan Toh
- SIAM Journal on Optimization
- 2010

We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In order to analyze the rate ofâ€¦ (More)

- Kim-Chuan Toh
- Math. Program.
- 2008

We propose primal-dual path-following Mehrotra-type predictor-corrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{2X â€¢ Q(X) + C â€¢ X : A(X) = b,Xâ€¦ (More)

- Kim-Chuan Toh, Lloyd N. Trefethen
- SIAM J. Matrix Analysis Applications
- 1998

A Chebyshev polynomial of a square matrix A is a monic polynomial p of specified degree that minimizes â€–p(A)â€–2. The study of such polynomials is motivated by the analysis of Krylov subspaceâ€¦ (More)

- Lu Li, Kim-Chuan Toh
- Math. Program. Comput.
- 2010

Sparse covariance selection problems can be formulated as log-determinant (log-det ) semidefinite programming (SDP) problems with large numbers of linear constraints. Standard primal-dualâ€¦ (More)

- Kim-Chuan Toh, Lloyd N. Trefethen
- SIAM J. Scientific Computing
- 1996

The Amoldi iteration, usually viewed as a method for calculating eigenvalues, can also be used to estimate pseudospectra. This possibility may be of practical importance, because in applicationsâ€¦ (More)

- Sangwoon Yun, Kim-Chuan Toh
- Comp. Opt. and Appl.
- 2011

In applications such as signal processing and statistics, many problems involve finding sparse solutions to under-determined linear systems of equations. These problems can be formulated as aâ€¦ (More)

- Ngai-Hang Z. Leung, Kim-Chuan Toh
- SIAM J. Scientific Computing
- 2009

We propose the DISCO algorithm for graph realization in Rd, given sparse and noisy short-range inter-vertex distances as inputs. Our divide-and-conquer algorithm works as follows. When a group has aâ€¦ (More)