Detecting redundancy in optimization problems over intersection of ellipsoids

Shafiu Jibrin

doi:10.1080/09720502.2002.10700315

Detecting redundancy in optimization problems over intersection of ellipsoids

Shafiu Jibrin

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	183-194
Number of pages	12
Journal	Journal of Interdisciplinary Mathematics
Volume	5
Issue number	2
DOIs	https://doi.org/10.1080/09720502.2002.10700315
State	Published - 2002

Keywords

Ellipsoidal constraints
Redundancy
S-procedure
Semidefinite programming

ASJC Scopus subject areas

Analysis
Applied Mathematics

Access to Document

10.1080/09720502.2002.10700315

Cite this

@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",

note = "Funding Information: Acknowledgements. This work was partially supported by IGP grant of the Northern Arizona University, Flagstaff.",

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

N1 - Funding Information: Acknowledgements. This work was partially supported by IGP grant of the Northern Arizona University, Flagstaff.

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

AN - SCOPUS:84888603380

SN - 0972-0502

VL - 5

SP - 183

EP - 194

JO - Journal of Interdisciplinary Mathematics

JF - Journal of Interdisciplinary Mathematics

IS - 2

ER -

Detecting redundancy in optimization problems over intersection of ellipsoids

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this