Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification
Tran Ngoc Nguyen ()
Additional contact information
Tran Ngoc Nguyen: Quy Nhon University
Computational Optimization and Applications, 2025, vol. 91, issue 3, No 4, 1105-1134
Abstract:
Abstract In this paper, we exploit some properties of points in a neighborhood of the solution set of degenerate optimization problems. Combining these facts with the boundedness of the inverse of regularized Jacobian matrix arising in a mixed logarithmic barrier-augmented lagrangian method, we propose an updating rule for parameters of a mixed logarithmic barrier-augmented Lagrangian algorithm. The superlinear convergence of this algorithm is then proved without any constraint qualification. Numerical results on degenerate problems are also presented to confirm theoretical results.
Keywords: Nonlinear programming; Augmented lagrangian; Interior point; constraint qualification; Regularization (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10589-025-00690-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:91:y:2025:i:3:d:10.1007_s10589-025-00690-z
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-025-00690-z
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().