A first-order interior-point method for linearly constrained smooth optimization

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. Key words. Linearly constrained optimization, affine scaling, replicator dynamics, interior-point method, global convergence, sublinear convergence rate

• Type: Journal
• Year: 2011
• Where: MP
• Authors: Paul Tseng, Immanuel M. Bomze, Werner Schachinger
• Keywords: Convergence, Convergence Rate, Global Convergence, Intelligent Agents, MP 2011