Steepest-Descent Approach to Triple Hierarchical Constrained Optimization Problems

Lu-Chuan Ceng, Cheng-Wen Liao, Chin-Tzong Pang and Ching-Feng Wen

Abstract and Applied Analysis, 2014, vol. 2014, 1-19

Abstract:

We introduce and analyze a hybrid steepest-descent algorithm by combining Korpelevich’s extragradient method, the steepest-descent method, and the averaged mapping approach to the gradient-projection algorithm. It is proven that under appropriate assumptions, the proposed algorithm converges strongly to the unique solution of a triple hierarchical constrained optimization problem (THCOP) over the common fixed point set of finitely many nonexpansive mappings, with constraints of finitely many generalized mixed equilibrium problems (GMEPs), finitely many variational inclusions, and a convex minimization problem (CMP) in a real Hilbert space.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/264965.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/264965.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:264965

DOI: 10.1155/2014/264965

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().