Optimization Online


Computational Enhancements in Low-Rank Semidefinite Programming

Samuel Burer (samuel-burer***at***uiowa.edu)
Changhui Choi (changhui-choi***at***uiowa.edu)

Abstract: We discuss computational enhancements for the low-rank semidefinite programming algorithm, including the extension to block semidefinite programs, an exact linesearch procedure, and a dynamic rank reduction scheme. A truncated Newton method is also introduced, and several preconditioning strategies are proposed. Numerical experiments illustrating these enhancements are provided.


Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Citation: Manuscript, Department of Mangagement Sciences, University of Iowa, July 2004

Download: [PDF]

Entry Submitted: 07/12/2004
Entry Accepted: 07/12/2004
Entry Last Modified: 07/12/2004

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society