A Logarithmic-Quadratic Proximal Point Scalarization Method for Multiobjective Programming
Abstract: We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map F with respect to the lexicographic order on Rm and we add a variant of the logarithmquadratic regularization of Auslender, where the unconstrained variables in the domain of F are introduced on the quadratic term and the constrained variables employed in the scalarization we put on the logarithmic term. We show that the central trajectory of the scalarized problem is bounded and converges to a weak Pareto of the multiobjective problem .
Keywords: proximal point algorithm, scalar representations, multiobjective programming.
Category 1: Other Topics (Multi-Criteria Optimization )
Entry Submitted: 01/23/2009
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|