levenberg-marquardt (lm) algorithms are a class of methods that add a regularization term to a gauss-newton method to promote better convergence properties. this talk presents three works on this class of methods. the first discusses a new method that simultaneously achieves all types of state of the art convergence guarantees for unconstrained problems. stochastic lm is discussed next, which is an algorithm to handle noisy data. an example is presented on data assimilation. finally, a lm method is presented to handle equality constraints, with examples from inverse problems in pdes.