Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. An intermixed iteration for constrained convex minimization problem and split feasibility problem
Loading...
Thumbnail Image

An intermixed iteration for constrained convex minimization problem and split feasibility problem

Author(s)
Saechou, Kanyanee
Kangtunyakarn, Atid
Date Issued
January 1, 2019
Type
Article
DOI
10.1186/s13660-019-2222-4
Abstract
In this paper, we first introduce the two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and also we prove a strong convergence theorem for the intermixed algorithm. By using our main theorem, we prove a strong convergence theorem for the split feasibility problem. Finally, we apply our main theorem for the numerical example.
Citation
Journal of Inequalities and Applications, 2019(1), 2019
Subjects

Constrained convex mi...

Split feasibility pro...

Variational inequalit...

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback