On the Nesterov--Todd Direction in Semidefinite Programming

Authors:
M. J. Todd;K. C. Toh;R. H. Tütüncü
Affiliations:
-;-;-
Venue:
SIAM Journal on Optimization
Year:
1998

Citing 0
Cited 14

Primal-Dual Path-Following Algorithms for Determinant Maximization Problems With Linear Matrix Inequalities

Computational Optimization and Applications
A Note on the Calculation of Step-Lengths in Interior-Point Methods for Semidefinite Programming

Computational Optimization and Applications
Solving Hankel matrix approximation problem using semidefinite programming

Journal of Computational and Applied Mathematics
Estimation of positive semidefinite correlation matrices by using convex quadratic semidefinite programming

Neural Computation
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification

SIAM Journal on Matrix Analysis and Applications
Nonnegative factorization of diffusion tensor images and its applications

IPMI'11 Proceedings of the 22nd international conference on Information processing in medical imaging
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity

SIAM Journal on Optimization
Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg-Kojima-Monteiro Direction

SIAM Journal on Optimization
A large-update primal-dual interior-point method for second-order cone programming

ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part I
An inexact spectral bundle method for convex quadratic semidefinite programming

Computational Optimization and Applications
An efficient multiple-kernel learning for pattern classification

Expert Systems with Applications: An International Journal
A homotopy method for nonlinear semidefinite programming

Computational Optimization and Applications
A new O(nL) -iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming

Journal of Computational and Applied Mathematics
Curvature integrals and iteration complexities in SDP and symmetric cone programs

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 be computed efficiently and demonstrate how they can be viewed as Newton directions. This last observation also leads to convenient computation of accelerated steps, using the Mehrotra predictor-corrector approach, in the NT framework. We also provide an analytical and numerical comparison of several methods using different search directions, and suggest that the method using the NT direction is more robust than alternative methods.