Semidefinite Programming

  • Ding-Zhu Du
  • Panos M. Pardalos
  • Weili Wu
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 56)

Abstract

Semidefinite programming is a nonlinear programming with linear objective function and semidefinite constraints, which has a lot of properties similar to linear programming. It is an important tool to design polynomial-time approximation for NP-hard problems.

Keywords

Feasible Solution Positive Semidefinite Semidefinite Program Convexification Relaxation Vertex Subset 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Ding-Zhu Du
    • 1
  • Panos M. Pardalos
    • 2
  • Weili Wu
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of MinnesotaMinneapolisUSA
  2. 2.Center for Applied Optimization, ISE DepartmentUniversity of FloridaGainesvilleUSA

Personalised recommendations