Abstract

In this paper we study a from of convex quadratic semi-infinite programming problems with finitely many variables and infinitely many constraints over a compact metric space. An entropic path-following algorithum is introduced with a convergence proof. Some practical implementations and numerical experiments are also included

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call