A Full-Newton Step Interior-Point Method for Weighted Quadratic Programming Based on the Algebraic Equivalent Transformation
In this paper, a new full-Newton step feasible interior-point method for convex quadratic programming is presented and analyzed. The idea behind this method is to replace the complementarity condition with a non-negative weight vector and use the algebraic equivalent transformation for the obtained...
Main Authors: | Yongsheng Rao, Jianwei Su, Behrouz Kheirfam |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-04-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/12/7/1104 |
Similar Items
-
An infeasible interior point methods for convex quadratic problems
by: Hayet Roumili, et al.
Published: (2018-12-01) -
A new search direction for full-Newton step infeasible interior-point method in linear optimization
by: Behrouz Kheirfam
Published: (2023-01-01) -
A full-modified-Newton step infeasible interior-point method for monotone linear complementarity problem
by: Nezameddin Mahdavi-Amiri, et al.
Published: (2021-05-01) -
A numerical study of an infeasible interior-point algorithm for convex quadratic semi-definite optimization
by: Yasmina Bendaas, et al.
Published: (2024-12-01) -
A new search direction of IPM for horizontal linear complementarity problems
by: Xiaoyu Gong, et al.
Published: (2023-01-01)