Primal-dual interior-point methods for semidefinite programming: numerical experience with block-diagonal problems

Madhu V. Nayakkankuppam, Michael L. Overton

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we briefly describe two interior-point algorithms for semidefinite programming. At each iteration, both these algorithms compute search directions by solving a linear system. We discuss some preliminary experiments for moderately sized, block diagonal semidefinite programs, comparing direct and iterative methods for solving the linear systems.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE International Symposium on Computer-Aided Control System Design
Editors Anon
Pages235-239
Number of pages5
StatePublished - 1996
EventProceedings of the 1996 IEEE International Symposium on Computer-Aided Control System Design - Dearborn, MI, USA
Duration: Sep 15 1996Sep 18 1996

Other

OtherProceedings of the 1996 IEEE International Symposium on Computer-Aided Control System Design
CityDearborn, MI, USA
Period9/15/969/18/96

Fingerprint

Linear systems
Iterative methods
Experiments

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Nayakkankuppam, M. V., & Overton, M. L. (1996). Primal-dual interior-point methods for semidefinite programming: numerical experience with block-diagonal problems. In Anon (Ed.), Proceedings of the IEEE International Symposium on Computer-Aided Control System Design (pp. 235-239)

Primal-dual interior-point methods for semidefinite programming : numerical experience with block-diagonal problems. / Nayakkankuppam, Madhu V.; Overton, Michael L.

Proceedings of the IEEE International Symposium on Computer-Aided Control System Design. ed. / Anon. 1996. p. 235-239.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nayakkankuppam, MV & Overton, ML 1996, Primal-dual interior-point methods for semidefinite programming: numerical experience with block-diagonal problems. in Anon (ed.), Proceedings of the IEEE International Symposium on Computer-Aided Control System Design. pp. 235-239, Proceedings of the 1996 IEEE International Symposium on Computer-Aided Control System Design, Dearborn, MI, USA, 9/15/96.
Nayakkankuppam MV, Overton ML. Primal-dual interior-point methods for semidefinite programming: numerical experience with block-diagonal problems. In Anon, editor, Proceedings of the IEEE International Symposium on Computer-Aided Control System Design. 1996. p. 235-239
Nayakkankuppam, Madhu V. ; Overton, Michael L. / Primal-dual interior-point methods for semidefinite programming : numerical experience with block-diagonal problems. Proceedings of the IEEE International Symposium on Computer-Aided Control System Design. editor / Anon. 1996. pp. 235-239
@inproceedings{3f6ab281f10e48faae0c86f72290928e,
title = "Primal-dual interior-point methods for semidefinite programming: numerical experience with block-diagonal problems",
abstract = "In this paper, we briefly describe two interior-point algorithms for semidefinite programming. At each iteration, both these algorithms compute search directions by solving a linear system. We discuss some preliminary experiments for moderately sized, block diagonal semidefinite programs, comparing direct and iterative methods for solving the linear systems.",
author = "Nayakkankuppam, {Madhu V.} and Overton, {Michael L.}",
year = "1996",
language = "English (US)",
pages = "235--239",
editor = "Anon",
booktitle = "Proceedings of the IEEE International Symposium on Computer-Aided Control System Design",

}

TY - GEN

T1 - Primal-dual interior-point methods for semidefinite programming

T2 - numerical experience with block-diagonal problems

AU - Nayakkankuppam, Madhu V.

AU - Overton, Michael L.

PY - 1996

Y1 - 1996

N2 - In this paper, we briefly describe two interior-point algorithms for semidefinite programming. At each iteration, both these algorithms compute search directions by solving a linear system. We discuss some preliminary experiments for moderately sized, block diagonal semidefinite programs, comparing direct and iterative methods for solving the linear systems.

AB - In this paper, we briefly describe two interior-point algorithms for semidefinite programming. At each iteration, both these algorithms compute search directions by solving a linear system. We discuss some preliminary experiments for moderately sized, block diagonal semidefinite programs, comparing direct and iterative methods for solving the linear systems.

UR - http://www.scopus.com/inward/record.url?scp=0029764249&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029764249&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0029764249

SP - 235

EP - 239

BT - Proceedings of the IEEE International Symposium on Computer-Aided Control System Design

A2 - Anon, null

ER -