Generalized Projection Algorithm for Convex Feasibility Problems on Hadamard Manifolds

Authors

Keywords:

Hadamard manifold, convex feasibility problem, firmly nonexpansive mapping, projection algorithm

Abstract

We present a two-step cyclic algorithm for solving convex feasibility problems on Hadamard manifolds in this study. On Hadamard manifolds, the convergent result and linear convergent results are proven. In addition, to support the main results, a numerical example on the Poincaré plane is provided.

Author Biographies

Konrawut Khammahawong, Rajamangala University of Technology Thanyaburi (RMUTT)

Lecturer at the Department of Mathematics and Computer Science, Faculty of Science and Technology, Rajamangala University of Technology Thanyaburi (RMUTT), Thailand


Poom Kumam, King Mongkut’s University of Technology Thonburi (KMUTT)

Professor of Mathematics at

1. Center of Excellence in Theoretical and Computational Science (TaCS-CoE) and KMUTTFixed Point, Research Laboratory, Room SCL 802 Fixed Point Laboratory Science Laboratory Building, Department of Mathematics, Faculty of Science, King Mongkut's University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thung Khru, Bangkok 10140, Thailand.
2. NCAO Research Center, Fixed Point Theory and Applications Research Group, Center of Excellence in Theoretical and Computational Science (TaCSCoE), Faculty of Science, King Mongkut's University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Rd, Bang Mod, Thung Khru, Bangkok 10140, Thailand.

Downloads

Published

2022-03-03

How to Cite

Khammahawong, K., & Kumam, P. (2022). Generalized Projection Algorithm for Convex Feasibility Problems on Hadamard Manifolds. Nonlinear Convex Analysis and Optimization: An International Journal on Numerical, Computation and Applications, 1(1), 25–45. Retrieved from https://bangmodjmcs.com/index.php/ncao/article/view/75

Issue

Vol. 1 No. 1 (2022): January - June, 2022

Section

Articles

License

Copyright (c) 2022 Konrawut Khammahawong, Poom Kumam

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Open Access Policy

This journal provides immediate open access to its content on the principle that making research freely available to the public.

Publication Charges

There are no charges to submit and publish an article in the Nonlinear Convex Analysis and Optimization (NCAO): An International Journal on Numerical, Computation and Applications. All articles published in our journal are open access and are freely and widely available to all readers via the journal website.

Most read articles by the same author(s)