首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the convergence of Han's method for convex programming with quadratic objective
Authors:Alfredo N Iusem  Alvaro R De Pierro
Institution:(1) Instituto de Matemática Pura e Aplicada, Estrada Dona Castorina 110, CEP 22460 Rio de Janeiro, RJ, Brazil;(2) Instituto de Matemática, Estatística e Ciência da Computação, Universidade de Campinas, C.P. 6065, CEP 13081 Campinas, SP, Brazil
Abstract:We present an iterative method for minimizing strictly convex quadratic functions over the intersection of a finite number of convex sets. The method consists in computing projections onto the individual sets simultaneously and the new iterate is a convex combination of those projections. We give convergence proofs even for the inconsistent case, i.e. when the intersection of the sets is empty.Work of this author was partially supported by CNPq under grant No. 301280/86-MA.
Keywords:Minimization  parallel projections
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号