An Efficient Proximal Point Algorithm for Unweighted Max-Min Dispersion Problem* - Advances in Pure Mathematics

APM > Vol.8 No.4, April 2018

An Efficient Proximal Point Algorithm for Unweighted Max-Min Dispersion Problem* ()

HTML XML

Download as PDF (Size: 208KB) PP. 400-407

DOI: 10.4236/apm.2018.84022 645 Downloads 1,261 Views

Author(s)

Siqi Tao

Affiliation(s)

Department of Mathematics, College of Sciences, Shanghai University, Shanghai, China.

ABSTRACT

In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.

KEYWORDS

Maximum Weighted Dispersion Problem, Adaptive Custom Proximal Point Al-gorithm, NP-Hard

Share and Cite:

Tao, S. (2018) An Efficient Proximal Point Algorithm for Unweighted Max-Min Dispersion Problem*. Advances in Pure Mathematics, 8, 400-407. doi: 10.4236/apm.2018.84022.

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies