Skip to main content
SpringerLink
Log in

Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming

  • Published:
Mathematical Programming Submit manuscript

Abstract.

 In this paper, we describe how to reformulate a problem that has second-order cone and/or semidefiniteness constraints in order to solve it using a general-purpose interior-point algorithm for nonlinear programming. The resulting problems are smooth and convex, and numerical results from the DIMACS Implementation Challenge problems and SDPLib are provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Dept. of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544, e-mail: hyurttan@princeton.edu, , , , , , US

    Hande Y. Benson

  2. Dept. of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544, e-mail: rvdb@princeton.edu, , , , , , US

    Robert J. Vanderbei

Authors
  1. Hande Y. Benson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert J. Vanderbei
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: March 10, 2001 / Accepted: January 18, 2002 Published online: September 27, 2002

Key Words. semidefinite programming – second-order cone programming – interior-point methods – nonlinear programming

Mathematics Subject Classification (2000): 20E28, 20G40, 20C20

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benson, H., Vanderbei, R. Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming. Math. Program., Ser. B 95, 279–302 (2003). https://doi.org/10.1007/s10107-002-0350-x

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-002-0350-x

Keywords

Search

Navigation