Optimization Online


A Linear Scalarization Proximal Point Method for Quasiconvex Multiobjective Minimization

E. A. Papa Quiroz(erikpapa***at***gmail.com)
H. C. F. Apolinário(hellena***at***ft.edu.br)
K.D.V Villacorta(kelydvv***at***ci.ufpb.br)
P.R. Oliveira(poliveir***at***cos.ufrj.br)

Abstract: In this paper we propose a linear scalarization proximal point algorithm for solving arbitrary lower semicontinuous quasiconvex multiobjective minimization problems. Under some natural assumptions and using the condition that the proximal parameters are bounded we prove the convergence of the sequence generated by the algorithm and when the objective functions are continuous, we prove the convergence to a generalized critical point. Furthermore, if each iteration minimize the proximal regularized function and the proximal parameters converges to zero we prove the convergence to a weak Pareto solution. In the continuously differentiable case, it is proved the global convergence of the sequence to a Pareto critical point and we introduce an inexact algorithm with the same convergence properties. We also analyze particular cases of the algorithm obtained finite convergence to a Pareto optimal point when the objective functions are convex and a sharp minimum condition is satisfied.

Keywords: Multiobjective minimization; lower semicontinuous quasiconvex functions; proximal point methods; Fejér convergence; Pareto-Clarke critical point; finite convergence.

Category 1: Other Topics (Multi-Criteria Optimization )

Category 2: Nonlinear Optimization (Unconstrained Optimization )

Category 3: Nonlinear Optimization


Download: [PDF]

Entry Submitted: 10/01/2015
Entry Accepted: 10/01/2015
Entry Last Modified: 10/01/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society