On finding a generalized lowest rank solution to a linear semi-definite feasibility problem

Chee Khian Sim

doi:10.1016/j.orl.2015.04.003

On finding a generalized lowest rank solution to a linear semi-definite feasibility problem

Chee Khian Sim

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

255 Downloads (Pure)

Abstract

In this note, we generalize the affine rank minimization problem and the vector cardinality minimization problem and show that the resulting generalized problem can be solved by solving a sequence of continuous concave minimization problems. In the case of the vector cardinality minimization problem, we show that it can be solved exactly by solving the continuous concave minimization problem.

Original language	English
Pages (from-to)	334-338
Number of pages	5
Journal	Operations Research Letters
Volume	43
Issue number	3
Early online date	17 Apr 2015
DOIs	https://doi.org/10.1016/j.orl.2015.04.003
Publication status	Published - 1 May 2015

Keywords

affine rank minimization problem
vector cardinality minimization problem
concave minimization problem

Access to Document

10.1016/j.orl.2015.04.003

lowestrankLSDFPORLetters_thirdrevisedAccepted author manuscript (Post-print), 223 KBLicence: CC BY-NC-ND

13th EUROPT Workshop on Advances in Continuous Optimization
Sim, C. K. (Presented paper)
2015
Activity: Participating in or organising an event types › Participation in workshop, seminar, course

Cite this

@article{af3ad4787d2f4026a44b978fd5bdf6ed,

title = "On finding a generalized lowest rank solution to a linear semi-definite feasibility problem",

abstract = "In this note, we generalize the affine rank minimization problem and the vector cardinality minimization problem and show that the resulting generalized problem can be solved by solving a sequence of continuous concave minimization problems. In the case of the vector cardinality minimization problem, we show that it can be solved exactly by solving the continuous concave minimization problem. ",

keywords = "affine rank minimization problem, vector cardinality minimization problem, concave minimization problem",

author = "Sim, \{Chee Khian\}",

year = "2015",

month = may,

day = "1",

doi = "10.1016/j.orl.2015.04.003",

language = "English",

volume = "43",

pages = "334--338",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier BV",

number = "3",

}

TY - JOUR

T1 - On finding a generalized lowest rank solution to a linear semi-definite feasibility problem

AU - Sim, Chee Khian

PY - 2015/5/1

Y1 - 2015/5/1

N2 - In this note, we generalize the affine rank minimization problem and the vector cardinality minimization problem and show that the resulting generalized problem can be solved by solving a sequence of continuous concave minimization problems. In the case of the vector cardinality minimization problem, we show that it can be solved exactly by solving the continuous concave minimization problem.

AB - In this note, we generalize the affine rank minimization problem and the vector cardinality minimization problem and show that the resulting generalized problem can be solved by solving a sequence of continuous concave minimization problems. In the case of the vector cardinality minimization problem, we show that it can be solved exactly by solving the continuous concave minimization problem.

KW - affine rank minimization problem

KW - vector cardinality minimization problem

KW - concave minimization problem

UR - http://www.sciencedirect.com/science/article/pii/S0167637715000516

U2 - 10.1016/j.orl.2015.04.003

DO - 10.1016/j.orl.2015.04.003

M3 - Article

SN - 0167-6377

VL - 43

SP - 334

EP - 338

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

On finding a generalized lowest rank solution to a linear semi-definite feasibility problem

Abstract

Keywords

Access to Document

Fingerprint

Activities

13th EUROPT Workshop on Advances in Continuous Optimization

Cite this