Steepest-Descent Approach to Triple Hierarchical Constrained Optimization Problems
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 strongl...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2014/264965 |