Optimization Online


The inexact projected gradient method for quasiconvex vector optimization problems

J.Y. Bello Cruz(yunier.bello***at***gmail.com)
G. Bento(glaydston***at***ufg.br)
G. Bouza Allende(gema***at***matcom.uh.cu)
R.F.B. Costa(raynerbarbosa***at***gmail.com)

Abstract: Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is important to have practical solution approaches for computing. In this work, we consider the inexact projected gradient-like method for solving smooth constrained vector optimization problems. Basically, we prove global convergence of any sequence produced by the method to a stationary point assuming that the objective function of the problem is $K$-quasiconvex, instead of the stronger $K$-convexity assumed in the literature.

Keywords: Gradient-like method; Vector optimization; $K$-- quasiconvexity.

Category 1: Other Topics (Multi-Criteria Optimization )

Category 2: Convex and Nonsmooth Optimization (Generalized Convexity/Monoticity )

Category 3: Nonlinear Optimization


Download: [PDF]

Entry Submitted: 12/13/2013
Entry Accepted: 12/14/2013
Entry Last Modified: 12/13/2013

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