A Modified Primal-Dual Interior Point Method for Solving Convex Quadratic Optimization Problems
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
This study presents a modified primal-dual interior point method (MPD-IPM) for solving convex quadratic optimization problems. The modification is performed through linearization of the central path and the introduction of an improved initialization strategy derived from the derivative structure of the Lagrangian function, unlike the classical approach, whose iterates follow a nonlinear trajectory. The proposed formulation generates linearized subsidiary constraint equations that reduce curvature effects during path-following. Numerical experiments conducted on benchmark and hypothetically generated problems demonstrate improved iteration counts, enhanced convergence reliability, and reduced computational time, particularly for large-scale instances.
Fields of Study & Subjects
Advanced Optimization Algorithms Research
Matrix Theory and Algorithms
Advanced Control Systems Optimization
Publication details
- Journal / source
- Open Journal of Optimization
- Volume
- 15
- Issue
- 01
- Pages
- 1–21
- Publication date
- 1 January 2026
- Language
- EN