MULTIPLIER METHOD FOR PROXIMAL CONVEX OPTIMIZATION SEPARABLE

• Autores: Papa Quiroz, Erik Alex, Sarmiento Chumbes, Orlando
• Formato: artículo
• Fecha de Publicación: 2011
• Institución: Universidad Nacional Mayor de San Marcos
• Repositorio: Revistas - Universidad Nacional Mayor de San Marcos
• Lenguaje: español
• OAI Identifier: oai:ojs.csi.unmsm:article/9590
• Enlace del recurso: https://revistasinvestigacion.unmsm.edu.pe/index.php/matema/article/view/9590
• Nivel de acceso: acceso abierto
• Materia: Proximal point methods; separable convex problems; non negative orthant; proximal distances; convex functions.; Métodos proximales; problemas convexos separables; ortante no negativo; distancia generalizada; funciones convexas.

The aim of this work is to prove the convergence of a proximal multiplicator method using generalized distances to solve convex minimization problems with separable structure, motivated in particular by the solution of optimization problems that arising in telecommunication networks and management of electrical energy production. The used procedures were the collection of information in scientific journals and specialized books, the study of the same and finally the use of mathematical tools to study the convergence of the sequence of the proposed method. The results show that, under some appropriate assumptions, the iterations generated by the method are well defined and the sequence converges to an optimal solution of the problem. Due to the generality of the study some papers related to proximal methods such as the works of Chen and Teboulle (1994), Kyono and Fukushima (2000) and Auslender and Teboulle (2001) are particular cases of our approach.