Hybrid proximal point algorithm for solution of convex multiobjective optimization problem over fixed point constraint

MaRDI QIDQ3384684zbMATH OpenFDO

Authors Fouzia Amir, Narin Petrot, A. Farajzadeh

Publication date 17 December 2021

Full work available at URL http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/4428

zbMATH Keywords

fixed pointmultiobjective optimizationnonexpansive mappings

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10)

Recommendations

• A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
• Generalized proximal point algorithms for multiobjective optimization problems
• Inexact proximal point algorithm for multiobjective optimization
• Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
• A proximal point algorithm with quasi-distance in multi-objective optimization

Cites work

• scientific article; zbMATH DE number 1149788 (Why is no real title available?)
• scientific article; zbMATH DE number 908535 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
• A projected gradient method for vector optimization problems
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex functionals and generalized harmonic maps into spaces of non positive curvature
• Firmly nonexpansive mappings in classes of geodesic spaces
• Fixed Points by a New Iteration Method
• Gradient flows in metric spaces and in the space of probability measures
• Mean Value Methods in Iteration
• Monotone Operators and the Proximal Point Algorithm
• Newton's method for multiobjective optimization
• On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval
• Proximal Methods in Vector Optimization
• Proximal point algorithms for finding common fixed points of a finite family of quasi-nonexpansive multi-valued mappings in real Hilbert spaces
• Proximal point algorithms involving fixed point of nonspreading-type multivalued mappings in Hilbert spaces
• Steepest descent methods for multicriteria optimization.

Cited in

(3)

• The fixed point property in convex multi-objective optimization problem
• A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
• Convergence of some iterative algorithms for system of generalized set-valued variational inequalities

This page was built for publication: Hybrid proximal point algorithm for solution of convex multiobjective optimization problem over fixed point constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384684)