Abstract
The aim of this paper is to consider a general non-stationary optimization problem whose objective function need not be smooth in general and only approximation sequences are known instead of exact values of the functions. We apply a two-step technique where approximate solutions of a sequence of a generalized mixed variational inequality problem (GMVIP) are inserted in the iterative method of a selective coordinate-wise decomposition descent method. Its convergence is achieved under coercivity-type assumptions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Analysis and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
