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


A first-order interior-point method for linearly constrained smooth optimization
Authors:Paul Tseng  Immanuel M Bomze  Werner Schachinger
Institution:(3) Dept. Computer Sci. and Engin. Univ. Minnesota, Minneapolis, MN 55455, USA;(4) Center for Applied Optim. Dept. Industrial and Systems Engin. Univ. Florida, Gainesville, FL 32611, USA;(5) Dept. Computer Sci. and Engin. Univ. Minnesota, Minneapolis, MN 55455, USA
Abstract:We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator dynamics method for standard quadratic programming. Global convergence and, in the case of quadratic program, (sub)linear convergence rate and iterate convergence results are derived. Numerical experience on simplex constrained problems with 1000 variables is reported.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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