2018/02/22 by Masomeh Abbasi, Abbasi, Masomeh
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Barrier function method #Convex quadratic programming #Differential-algebraic equations #Dynamic systems #Interior point method #Metaheuristic Optimization Algorithms Research #Optimization and Variational Analysis #Stability
paper · doi:10.82521/ijo.2019.1018745
openalex publication_date 2018/02/22 · openalex created_date 2018/05/17 · openalex updated_date 2026/07/07
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the new DAEs methods. Numerical results show the efficiency of the proposed model.