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. Iterative algorithms with the regularization for the constrained convex minimization problem and maximal monotone operators
Loading...
Thumbnail Image

Iterative algorithms with the regularization for the constrained convex minimization problem and maximal monotone operators

Author(s)
Khuangsatung, Wongvisarut
Kangtunyakarn, Atid
Date Issued
October 3, 2017
Type
Article
DOI
10.1080/02331934.2017.1343330
Abstract
In this paper, we prove a strong convergence theorem for finding a common element of the solution set of a constrained convex minimization problem and the set of solutions of a finite family of variational inclusion problems in Hilbert space. A strong convergence theorem for finding a common element of the solution set of a constrained convex minimization problem and the solution sets of a finite family of zero points of the maximal monotone operator problem in Hilbert space is also obtained. Using our main result, we have some additional results for various types of non-linear problems in Hilbert space.
Citation
Optimization, 66(10), 1623-1646, 2017
Subjects

Constrained convex mi...

maximal monotone oper...

resolvent operator

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