Characterization of the Convergence Rate of the Augmented Lagrange for the Nonlinear Semidefinite Optimization Problem

The convergence rate of the augmented Lagrangian method (ALM) for solving the nonlinear semidefinite optimization problem is studied. Under the Jacobian uniqueness conditions, when a multiplier vector (π,Y) and the penalty parameter σ are chosen such that σ is larger than a threshold σ*>0 and the ratio ∥(π,Y)−(π*,Y*)∥/σ is small enough, it is demonstrated that the convergence rate of the augmented Lagrange method is linear with respect to ∥(π,Y)−(π*,Y*)∥ and the ratio constant is proportional to 1/σ, where (π*,Y*) is the multiplier corresponding to a local minimizer. Furthermore, by analyzing the second-order derivative of the perturbation function of the nonlinear semidefinite optimization problem, we characterize the rate constant of local linear convergence of the sequence of Lagrange multiplier vectors produced by the augmented Lagrange method. This characterization shows that the sequence of Lagrange multiplier vectors has a Q-linear convergence rate when the sequence of penalty parameters {σk} has an upper bound and the convergence rate is superlinear when {σk} is increasing to infinity.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-06-11
DOI
https://doi.org/10.3390/math13121946
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Characterization of the Convergence Rate of the Augmented Lagrange for the Nonlinear Semidefinite Optimization Problem

Jia Wu, Haoyang Liu, Yule Zhang, Jihong Zhang
Mathematics
Optimization and Variational Analysis
article

Characterization of the Convergence Rate of the Augmented Lagrange for the Nonlinear Semidefinite Optimization Problem

Jia Wu, Haoyang Liu, Yule Zhang, Jihong Zhang
article en

Abstract

The convergence rate of the augmented Lagrangian method (ALM) for solving the nonlinear semidefinite optimization problem is studied. Under the Jacobian uniqueness conditions, when a multiplier vector (π,Y) and the penalty parameter σ are chosen such that σ is larger than a threshold σ*>0 and the ratio ∥(π,Y)−(π*,Y*)∥/σ is small enough, it is demonstrated that the convergence rate of the augmented Lagrange method is linear with respect to ∥(π,Y)−(π*,Y*)∥ and the ratio constant is proportional to 1/σ, where (π*,Y*) is the multiplier corresponding to a local minimizer. Furthermore, by analyzing the second-order derivative of the perturbation function of the nonlinear semidefinite optimization problem, we characterize the rate constant of local linear convergence of the sequence of Lagrange multiplier vectors produced by the augmented Lagrange method. This characterization shows that the sequence of Lagrange multiplier vectors has a Q-linear convergence rate when the sequence of penalty parameters {σk} has an upper bound and the convergence rate is superlinear when {σk} is increasing to infinity.

MathematicsVol. 13(12)
Shenyang Ligong University (CN), Dongbei University of Finance and Economics (CN), Dalian University of Technology (CN), Dalian Maritime University (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 85%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.