Abstract
We consider a general limit optimization problem whose goal function need not be smooth in general and only approximation sequences are known instead of exact values of this function. We suggest to apply a two-level approach where approximate solutions of a sequence of mixed variational inequality problems are inserted in the iterative scheme of a selective decomposition descent method. Its convergence is attained under coercivity type conditions.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
