Detecting redundancy in optimization problems over intersection of ellipsoids

Research output: Contribution to journalArticle

Abstract

An ellipsoid within a system of ellipsoids is called redundant if it contains the intersection of all the other ellipsoids. We provide a semidefinite programming based method that uses the probabilistic Semidefinite Stand-and-Hit (SSH) algorithm for detecting redundant ellipsoids. This detects more complicated instances of redundancy than those found by the S-procedure.

Original languageEnglish (US)
Pages (from-to)183-194
Number of pages12
JournalJournal of Interdisciplinary Mathematics
Volume5
Issue number2
DOIs
StatePublished - 2002

Fingerprint

Ellipsoid
Redundancy
Intersection
Optimization Problem
Semidefinite Programming
Hits

Keywords

  • Ellipsoidal constraints
  • Redundancy
  • S-procedure
  • Semidefinite programming

ASJC Scopus subject areas

  • Analysis
  • Applied Mathematics

Cite this

Detecting redundancy in optimization problems over intersection of ellipsoids. / Jibrin, Shafiu.

In: Journal of Interdisciplinary Mathematics, Vol. 5, No. 2, 2002, p. 183-194.

Research output: Contribution to journalArticle

@article{8bccd903e8ae4c3ba45561c5e8ce0ea2,
title = "Detecting redundancy in optimization problems over intersection of ellipsoids",
abstract = "An ellipsoid within a system of ellipsoids is called redundant if it contains the intersection of all the other ellipsoids. We provide a semidefinite programming based method that uses the probabilistic Semidefinite Stand-and-Hit (SSH) algorithm for detecting redundant ellipsoids. This detects more complicated instances of redundancy than those found by the S-procedure.",
keywords = "Ellipsoidal constraints, Redundancy, S-procedure, Semidefinite programming",
author = "Shafiu Jibrin",
year = "2002",
doi = "10.1080/09720502.2002.10700315",
language = "English (US)",
volume = "5",
pages = "183--194",
journal = "Journal of Interdisciplinary Mathematics",
issn = "0972-0502",
publisher = "TARU Publications",
number = "2",

}

TY - JOUR

T1 - Detecting redundancy in optimization problems over intersection of ellipsoids

AU - Jibrin, Shafiu

PY - 2002

Y1 - 2002

N2 - An ellipsoid within a system of ellipsoids is called redundant if it contains the intersection of all the other ellipsoids. We provide a semidefinite programming based method that uses the probabilistic Semidefinite Stand-and-Hit (SSH) algorithm for detecting redundant ellipsoids. This detects more complicated instances of redundancy than those found by the S-procedure.

AB - An ellipsoid within a system of ellipsoids is called redundant if it contains the intersection of all the other ellipsoids. We provide a semidefinite programming based method that uses the probabilistic Semidefinite Stand-and-Hit (SSH) algorithm for detecting redundant ellipsoids. This detects more complicated instances of redundancy than those found by the S-procedure.

KW - Ellipsoidal constraints

KW - Redundancy

KW - S-procedure

KW - Semidefinite programming

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

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

U2 - 10.1080/09720502.2002.10700315

DO - 10.1080/09720502.2002.10700315

M3 - Article

VL - 5

SP - 183

EP - 194

JO - Journal of Interdisciplinary Mathematics

JF - Journal of Interdisciplinary Mathematics

SN - 0972-0502

IS - 2

ER -