Open access
2026
Unconstrained reformulation of sequential quadratic programming for solving optimization problems with linear equality constraints
The concept of a regularized gap function is employed to reformulate the constrained problem into an unconstrained one and a positive definite Hessian modification along with a backtracking line search is incorporated to promote global convergence.
S. Chakraborty, M. Samei, Rudrajit Sadhu
· Yugoslav journal of operatio... · 0 citations