Generalized proximal point algorithms for multiobjective optimization problems

Z. Chen; X. X. Huang; Xiaoqi Yang

doi:10.1080/00036811.2010.483428

Generalized proximal point algorithms for multiobjective optimization problems

Z. Chen, X. X. Huang, Xiaoqi Yang

Research output: Journal article publication › Journal article › Academic research › peer-review

10 Citations (Scopus)

Abstract

In this article, we develop a generalized proximal point algorithm for finding a weak Pareto optimal solution of minimizing an extended vector-valued map with respect to the positive orthant in finite-dimensional spaces by the virtue of a Bregman distance function.

Original language	English
Pages (from-to)	935-949
Number of pages	15
Journal	Applicable Analysis
Volume	90
Issue number	6
DOIs	https://doi.org/10.1080/00036811.2010.483428
Publication status	Published - 1 Jun 2011

Keywords

Bregman distance function
Generalized proximal point algorithm
Multiobjective optimization
Weak Pareto optimal solution

ASJC Scopus subject areas

Analysis
Applied Mathematics

More information

10.1080/00036811.2010.483428

Cite this

@article{b6ead629431d46ec8cf5a495b976c0d2,

title = "Generalized proximal point algorithms for multiobjective optimization problems",

abstract = "In this article, we develop a generalized proximal point algorithm for finding a weak Pareto optimal solution of minimizing an extended vector-valued map with respect to the positive orthant in finite-dimensional spaces by the virtue of a Bregman distance function.",

keywords = "Bregman distance function, Generalized proximal point algorithm, Multiobjective optimization, Weak Pareto optimal solution",

author = "Z. Chen and Huang, {X. X.} and Xiaoqi Yang",

year = "2011",

month = jun,

day = "1",

doi = "10.1080/00036811.2010.483428",

language = "English",

volume = "90",

pages = "935--949",

journal = "Applicable Analysis",

issn = "0003-6811",

publisher = "Taylor and Francis Ltd.",

number = "6",

}

TY - JOUR

T1 - Generalized proximal point algorithms for multiobjective optimization problems

AU - Chen, Z.

AU - Huang, X. X.

AU - Yang, Xiaoqi

PY - 2011/6/1

Y1 - 2011/6/1

N2 - In this article, we develop a generalized proximal point algorithm for finding a weak Pareto optimal solution of minimizing an extended vector-valued map with respect to the positive orthant in finite-dimensional spaces by the virtue of a Bregman distance function.

AB - In this article, we develop a generalized proximal point algorithm for finding a weak Pareto optimal solution of minimizing an extended vector-valued map with respect to the positive orthant in finite-dimensional spaces by the virtue of a Bregman distance function.

KW - Bregman distance function

KW - Generalized proximal point algorithm

KW - Multiobjective optimization

KW - Weak Pareto optimal solution

UR - http://www.scopus.com/inward/record.url?scp=79956148522&partnerID=8YFLogxK

U2 - 10.1080/00036811.2010.483428

DO - 10.1080/00036811.2010.483428

M3 - Journal article

SN - 0003-6811

VL - 90

SP - 935

EP - 949

JO - Applicable Analysis

JF - Applicable Analysis

IS - 6

ER -

Generalized proximal point algorithms for multiobjective optimization problems

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this