A constraint shifting homotopy method for convex multi-objective programming

Authors:
Yufeng Shang;Bo Yu
Affiliations:
School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China and Section of Mathematics, Aviation University of the Air Force, Changchun 130022, China;School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China
Venue:
Journal of Computational and Applied Mathematics
Year:
2011

Citing 3
Cited 0

Numerical continuation methods: an introduction

Numerical continuation methods: an introduction
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Quantified Score

Hi-index	7.30

Visualization

Abstract

In this paper, a constraint shifting combined homotopy method for solving multi-objective programming problems with both equality and inequality constraints is presented. It does not need the starting point to be an interior point or a feasible point and hence is convenient to use. Under some assumptions, the existence and convergence of a smooth path to an efficient solution are proven. Simple numerical results are given.