Chance-Constrained Semidefinite Programming

Abstract

Semidefinite programs are a class of optimization problems that have been the focus of intense research during the past fifteen years. Semidefinite programs extend linear programs, and both are defined using deterministic data. However, uncertainty is naturally present in applications leading to optimization problems. Stochastic linear programs with recourse have been studied since the fifties as a way to deal with uncertainty in data defining linear programs. Recently, the authors have defined an analogous extension of semidefinite programs termed stochastic semidefinite programs with recourse to deal with uncertainty in data defining semidefinite programs. A prominent alternative for handling uncertainty in data defining linear programs is chance-constrained linear programming. In this paper we introduce an analogous extension of semidefinite programs termed chance-constrained semidefinite programs for handling uncertainty in data defining semidefinite programs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2000
Accession Number
ADA530454

Entities

People

  • K. A. Ariyawansa
  • Yuntao Zhu

Organizations

  • Washington State University

Tags

Communities of Interest

  • Air Platforms
  • C4I
  • Counter IED

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Convex Programming
  • Coverings
  • Ellipsoids
  • Evolutionary Algorithms
  • Fighter Aircraft
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Optimization
  • Probability
  • Semidefinite Programming
  • Standards
  • Uncertainty

Fields of Study

  • Engineering

Readers

  • Linear Algebra
  • Strategic Security Studies
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.