The University of Southampton
University of Southampton Institutional Repository

A half thresholding projection algorithmfor sparse solutions of LCPs

A half thresholding projection algorithmfor sparse solutions of LCPs
A half thresholding projection algorithmfor sparse solutions of LCPs
In this paper, we aim to find sparse solutions of the linear complementarity problems (LCPs), which has many applications such as bimatrix games and portfolio selection. Mathematically, the underlying model is NP-hard in general. Thus, an ℓ1/2 regularized projection minimization model is proposed for relaxation. A half thresholding projection (HTP) algorithm is then designed for this regularization model, and the convergence of HTP algorithm is studied. Numerical results demonstrate that the HTP algorithm can effectively solve this regularization model and output very sparse solutions of LCPs with high quality.
1862-4472
1231-1245
Shang, Meijuan
170b322d-2478-4938-986a-09e778e597b7
Zhang, Chao
c99789f4-ce55-4a97-bfae-4a8b999fe14d
Peng, Dingtao
9d96447b-3c3b-42ae-8fca-d1d4fab70885
Zhou, Shenglong
d183edc9-a9f6-4b07-a140-a82213dbd8c3
Shang, Meijuan
170b322d-2478-4938-986a-09e778e597b7
Zhang, Chao
c99789f4-ce55-4a97-bfae-4a8b999fe14d
Peng, Dingtao
9d96447b-3c3b-42ae-8fca-d1d4fab70885
Zhou, Shenglong
d183edc9-a9f6-4b07-a140-a82213dbd8c3

Shang, Meijuan, Zhang, Chao, Peng, Dingtao and Zhou, Shenglong (2015) A half thresholding projection algorithmfor sparse solutions of LCPs. Optimization Letters, 9 (6), 1231-1245. (doi:10.1007/s11590-014-0834-7).

Record type: Article

Abstract

In this paper, we aim to find sparse solutions of the linear complementarity problems (LCPs), which has many applications such as bimatrix games and portfolio selection. Mathematically, the underlying model is NP-hard in general. Thus, an ℓ1/2 regularized projection minimization model is proposed for relaxation. A half thresholding projection (HTP) algorithm is then designed for this regularization model, and the convergence of HTP algorithm is studied. Numerical results demonstrate that the HTP algorithm can effectively solve this regularization model and output very sparse solutions of LCPs with high quality.

This record has no associated files available for download.

More information

e-pub ahead of print date: 3 December 2014
Published date: 2015

Identifiers

Local EPrints ID: 442378
URI: http://eprints.soton.ac.uk/id/eprint/442378
ISSN: 1862-4472
PURE UUID: cf319607-88c9-4f3e-9ef9-d9e36175f07c
ORCID for Shenglong Zhou: ORCID iD orcid.org/0000-0003-2843-1614

Catalogue record

Date deposited: 14 Jul 2020 16:31
Last modified: 16 Mar 2024 08:32

Export record

Altmetrics

Contributors

Author: Meijuan Shang
Author: Chao Zhang
Author: Dingtao Peng
Author: Shenglong Zhou ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×