The adam algorithm has been very successful for solving non-convex optimization problems that appear in deep learning. Are there ways to extend adam to solve constrained optimization problems? Among the papers citing Adam, there are papers based on an augmented Lagrangian approach. Maybe, they are dealing with constraints by constructing an augmented Lagrangian. However, there are too many such papers. Some guidance will be useful.