Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification
摘要
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.