Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2024 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
HTML articles powered by AMS MathViewer

by Xin-Wei Liu, Yu-Hong Dai, Ya-Kui Huang and Jie Sun;
Math. Comp. 92 (2023), 1301-1330
DOI: https://doi.org/10.1090/mcom/3799
Published electronically: December 20, 2022

Abstract:

We introduce a twice differentiable augmented Lagrangian for nonlinear optimization with general inequality constraints and show that a strict local minimizer of the original problem is an approximate strict local solution of the augmented Lagrangian. A novel augmented Lagrangian method of multipliers (ALM) is then presented. Our method is originated from a generalization of the Hestenes-Powell augmented Lagrangian, and is a combination of the augmented Lagrangian and the interior-point technique. It shares a similar algorithmic framework with existing ALMs for optimization with inequality constraints, but it can use the second derivatives and does not depend on projections on the set of inequality constraints. In each iteration, our method solves a twice continuously differentiable unconstrained optimization subproblem on primal variables. The dual iterates, penalty and smoothing parameters are updated adaptively. The global and local convergence are analyzed. Without assuming any constraint qualification, it is proved that the proposed method has strong global convergence. The method may converge to either a Karush-Kuhn-Tucker (KKT) point or a singular stationary point when the converging point is a minimizer. It may also converge to an infeasible stationary point of nonlinear program when the problem is infeasible. Furthermore, our method is capable of rapidly detecting the possible infeasibility of the solved problem. Under suitable conditions, it is locally linearly convergent to the KKT point, which is consistent with ALMs for optimization with equality constraints. The preliminary numerical experiments on some small benchmark test problems demonstrate our theoretical results.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2020): 90C26, 90C30, 90C51
  • Retrieve articles in all journals with MSC (2020): 90C26, 90C30, 90C51
Bibliographic Information
  • Xin-Wei Liu
  • Affiliation: Institute of Mathematics, Hebei University of Technology, Tianjin 300401, People’s Republic of China
  • MR Author ID: 667307
  • ORCID: 0000-0002-9829-3395
  • Email: mathlxw@hebut.edu.cn
  • Yu-Hong Dai
  • Affiliation: Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, People’s Republic of China; and School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, People’s Republic of China
  • MR Author ID: 620453
  • ORCID: 0000-0002-6932-9512
  • Email: dyh@lsec.cc.ac.cn
  • Ya-Kui Huang
  • Affiliation: Institute of Mathematics, Hebei University of Technology, Tianjin 300401, People’s Republic of China
  • ORCID: 0000-0001-6149-3222
  • Email: hyk@hebut.edu.cn
  • Jie Sun
  • Affiliation: Institute of Mathematics, Hebei University of Technology, Tianjin 300401, People’s Republic of China; and School of Business, National University of Singapore, Singapore 119245, Singapore
  • ORCID: 0000-0001-5611-1672
  • Email: jsun@nus.edu.sg
  • Received by editor(s): July 27, 2021
  • Received by editor(s) in revised form: March 15, 2022, and August 8, 2022
  • Published electronically: December 20, 2022
  • Additional Notes: The first author was supported by the NSFC grants (nos. 12071108 and 11671116). The second author was supported by the NSFC grants (nos. 12021001, 11991021, 11991020 and 11971372), the National Key R&D Program of China (nos. 2021YFA 1000300 & 2021YFA 1000301), the Strategic Priority Research Program of Chinese Academy of Sciences (no. XDA27000000). The third author was supported by the NSFC grant (no. 11701137) and Natural Science Foundation of Hebei Province (no. A2021202010).
    The first author is the corresponding author.
  • © Copyright 2022 American Mathematical Society
  • Journal: Math. Comp. 92 (2023), 1301-1330
  • MSC (2020): Primary 90C26, 90C30, 90C51
  • DOI: https://doi.org/10.1090/mcom/3799
  • MathSciNet review: 4550327