Efficient method to compute search directions of infeasible primal-dual path-following interior-point method for large scale block diagonal quadratic programming
Quadratic programming is an important optimization problem that has applications in many areas such as finance, control, and management. Quadratic programs arisen in practice are often large but sparse, and they usually cannot be solved efficiently without exploiting their structures. Since existi...
Main Authors: | Duangpen Jetpipattanapong, Gun Srijuntongsiri |
---|---|
Format: | Article |
Language: | English |
Published: |
Prince of Songkla University
2021-10-01
|
Series: | Songklanakarin Journal of Science and Technology (SJST) |
Subjects: | |
Online Access: | https://rdo.psu.ac.th/sjst/journal/43-5/29.pdf |
Similar Items
-
A numerical study of an infeasible interior-point algorithm for convex quadratic semi-definite optimization
by: Yasmina Bendaas, et al.
Published: (2024-12-01) -
An infeasible interior point methods for convex quadratic problems
by: Hayet Roumili, et al.
Published: (2018-12-01) -
An infeasible interior point methods for convex quadratic problems
by: Hayet Roumili, et al.
Published: (2018-12-01) -
Primal-Dual Method of Solving Convex Quadratic Programming Problems
by: V. Moraru
Published: (2000-10-01) -
An Algebraic-Based Primal–Dual Interior-Point Algorithm for Rotated Quadratic Cone Optimization
by: Karima Tamsaouete, et al.
Published: (2023-03-01)