A First-Order Interior-Point Method For Linearly Constrained Smooth Optimization, M.Sc. Thesis Sharif University of Technology ; Peyghami, Mohammad Reza (Supervisor) ; Fotouhi, Morteza (Supervisor)
Abstract
In this thesis, we propose a first-order interior-point method for linearly constrained smooth optimization which was recently proposed in the literatuare 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, the (sub)linear convergence rate and iterate convergence results are derived.The method is implemented and numerical experiments on simplex onstrained problems with 1000 variables is reported
Cataloging briefA First-Order Interior-Point Method For Linearly Constrained Smooth Optimization, M.Sc. Thesis Sharif University of Technology ; Peyghami, Mohammad Reza (Supervisor) ; Fotouhi, Morteza (Supervisor)
Abstract
In this thesis, we propose a first-order interior-point method for linearly constrained smooth optimization which was recently proposed in the literatuare 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, the (sub)linear convergence rate and iterate convergence results are derived.The method is implemented and numerical experiments on simplex onstrained problems with 1000 variables is reported
Find in contentBookmark
|
|