iterative schemes for convex minimization problems with constraints
Clicks: 6
ID: 166672
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
1.5
/100
6 views
5 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #444 of 631 articles by views in science and technology of advanced materials
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 631 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
We first introduce and analyze one implicit iterative algorithm for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: the generalized mixed equilibrium problem, the system of generalized equilibrium problems, and finitely many variational inclusions in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another implicit iterative algorithm for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.
| Reference Key |
ceng2014abstractiterative
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Lu-Chuan Ceng;Cheng-Wen Liao;Chin-Tzong Pang;Ching-Feng Wen |
| Journal | science and technology of advanced materials |
| Year | 2014 |
| DOI |
10.1155/2014/209372
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.