EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-SA 4.0

Unconstrained reformulation of sequential quadratic programming for solving optimization problems with linear equality constraints

Suvra Chakraborty, Mohammad Samei, Rudrajit Sadhu

Yugoslav Journal of Operations Research · 2026 · (00) · 11-11

DOI: 10.2298/yjor251015011c ↗

Kurz gefasst

Fachartikel in der Zeitschrift Yugoslav Journal of Operations Research, 2026. Verfasst von Suvra Chakraborty und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we propose an alternative approach to Sequential Quadratic Programming (SQP) 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. The proposed algorithm incorporates a positive definite Hessian modification along with a backtracking line search to promote global convergence. Its effectiveness is demonstrated through several numerical experiments and geometric illustrations. Furthermore, applications of the proposed method are explored in optimal allocation, analytic center computation, and network flow problems.

Zitieren

APA

Chakraborty, S., Samei, M., & Sadhu, R. (2026). Unconstrained reformulation of sequential quadratic programming for solving optimization problems with linear equality constraints. Yugoslav Journal of Operations Research, 11-11. https://doi.org/10.2298/yjor251015011c

Vancouver

Chakraborty S, Samei M, Sadhu R. Unconstrained reformulation of sequential quadratic programming for solving optimization problems with linear equality constraints. Yugoslav Journal of Operations Research. 2026:11-11. doi:10.2298/yjor251015011c

BibTeX
@article{Chakraborty2026,
  author = {Chakraborty, Suvra and Samei, Mohammad and Sadhu, Rudrajit},
  title = {Unconstrained reformulation of sequential quadratic programming for solving optimization problems with linear equality constraints},
  journal = {Yugoslav Journal of Operations Research},
  year = {2026},
  number = {00},
  pages = {11--11},
  doi = {10.2298/yjor251015011c}
}
Kostenlos starten →