Abstract
Se desarrolla un marco general para el algoritmo de punto proximal generalizado, basado en la nocion de (H,r)- monotonia. Se examina el analisis de convergencia lineal para el algoritmo de punto proximal generalizado en el contexto de la resolucion de una clase de inclusiones no lineales variacional. Los resultados obtenidos generalizan y unifican una amplia gama de problemas en el contexto de lograr la convergencia lineal de los algoritmos punto proximal.
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.
