The augmented Lagrangian method can approximately solve convex optimization with least constraint violation

From MaRDI portal
Publication:6102759

DOI10.1007/s10107-022-01843-2zbMath1528.90256arXiv2111.06194OpenAlexW3214514323MaRDI QIDQ6102759

Yu-Hong Dai, Li-wei Zhang

Publication date: 23 June 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.06194




Related Items (1)



Cites Work


This page was built for publication: The augmented Lagrangian method can approximately solve convex optimization with least constraint violation