Hybrid Proximal Point Algorithm for Solution of Convex Multiobjective Optimization Problem over Fixed Point Constraint

Fouzia Amir, Ali Farajzadeh, Narin Petrot


The purpose of this paper is to consider the convex constraint multiobjective optimization problem, as the constrained set is a fixed point set of nonexpansive mapping. By owing the concepts of proximal method and Mann algorithm, we introduce the algorithm and aim to establish the convergence results of the such proposed iterative algorithm to compute a solution point the considered  constraint convex multiobjective optimization problem.

Full Text: PDF


  • There are currently no refbacks.

The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|