Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
Author:
- 1 January 2002
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 17 (6) , 1105-1154
Abstract
There is a large number of design choices to be made in the implementation of the primal-dual interior point method for mixed semidefinite and second order cone optimization. This article presents such issues in a unified framework whenever possible. However, semidefinite and second order cone components are sometimes treated separately to highlight the differences that are necessary for efficient implementations. While this article provides a comparison of choices made by different research groups, it is also the first article to provide an elaborate discussion of the implementation in SeDuMi.Keywords
This publication has 63 references indexed in Scilit:
- On weighted centers for semidefinite programmingEuropean Journal of Operational Research, 2000
- Symmetric primal-dual path-following algorithms for semidefinite programmingApplied Numerical Mathematics, 1999
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3Optimization Methods and Software, 1999
- Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programmingOptimization Methods and Software, 1999
- A study of search directions in primal-dual interior-point methods for semidefinite programmingOptimization Methods and Software, 1999
- Applications of second-order cone programmingLinear Algebra and its Applications, 1998
- Linear systems in Jordan algebras and primal-dual interior-point algorithmsJournal of Computational and Applied Mathematics, 1997
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991