NEAREST POINTS IN NONSIMPLICIAL CONES AND LCP'S WITH PSD SYMMETRIC MATRICES

K. S. Al-Sultan; K. G. Murty

doi:10.1201/9780429333439-13

NEAREST POINTS IN NONSIMPLICIAL CONES AND LCP'S WITH PSD SYMMETRIC MATRICES

K. S. Al-Sultan
, K. G. Murty

King Fahd University of Petroleum & Minerals

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

We diseuss eonditions for the equivalcnce of a linear eomplementary problem (Lep) with a positive semidefinite (PSD) symmetrie matrix to a nearest point prohlem over a Pos cone. VVe then elevelop an algorithm for this nearf'st point problem, anel report on its eomputational performance.

Original language	English
Title of host publication	Recent Developments in Mathematical Programming
Publisher	CRC Press
Pages	199-212
Number of pages	14
ISBN (Electronic)	9781000657623
ISBN (Print)	9781138413184
DOIs	https://doi.org/10.1201/9780429333439-13
State	Published - 1 Jan 2022

Bibliographical note

Publisher Copyright:
© 1991 by Taylor & Francis Group, LLC.

Keywords

Linear complementary problem
Nearest point problem. convex polyJ1f'dral eones
Pos eones

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1201/9780429333439-13

Cite this

@inbook{0726ca57f1754f74a0116a27df32376a,

title = "NEAREST POINTS IN NONSIMPLICIAL CONES AND LCP'S WITH PSD SYMMETRIC MATRICES",

abstract = "We diseuss eonditions for the equivalcnce of a linear eomplementary problem (Lep) with a positive semidefinite (PSD) symmetrie matrix to a nearest point prohlem over a Pos cone. VVe then elevelop an algorithm for this nearf'st point problem, anel report on its eomputational performance.",

keywords = "Linear complementary problem, Nearest point problem. convex polyJ1f'dral eones, Pos eones",

author = "Al-Sultan, \{K. S.\} and Murty, \{K. G.\}",

note = "Publisher Copyright: {\textcopyright} 1991 by Taylor \& Francis Group, LLC.",

year = "2022",

month = jan,

day = "1",

doi = "10.1201/9780429333439-13",

language = "English",

isbn = "9781138413184",

pages = "199--212",

booktitle = "Recent Developments in Mathematical Programming",

publisher = "CRC Press",

}

TY - CHAP

T1 - NEAREST POINTS IN NONSIMPLICIAL CONES AND LCP'S WITH PSD SYMMETRIC MATRICES

AU - Al-Sultan, K. S.

AU - Murty, K. G.

PY - 2022/1/1

Y1 - 2022/1/1

N2 - We diseuss eonditions for the equivalcnce of a linear eomplementary problem (Lep) with a positive semidefinite (PSD) symmetrie matrix to a nearest point prohlem over a Pos cone. VVe then elevelop an algorithm for this nearf'st point problem, anel report on its eomputational performance.

AB - We diseuss eonditions for the equivalcnce of a linear eomplementary problem (Lep) with a positive semidefinite (PSD) symmetrie matrix to a nearest point prohlem over a Pos cone. VVe then elevelop an algorithm for this nearf'st point problem, anel report on its eomputational performance.

KW - Linear complementary problem

KW - Nearest point problem. convex polyJ1f'dral eones

KW - Pos eones

UR - https://www.scopus.com/pages/publications/85141088969

U2 - 10.1201/9780429333439-13

DO - 10.1201/9780429333439-13

M3 - Chapter

AN - SCOPUS:85141088969

SN - 9781138413184

SP - 199

EP - 212

BT - Recent Developments in Mathematical Programming

PB - CRC Press

ER -

NEAREST POINTS IN NONSIMPLICIAL CONES AND LCP'S WITH PSD SYMMETRIC MATRICES

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this