This work investigates the convergence behavior of augmented Lagrangian methods (ALMs) when applied to convex optimization problems that may be infeasible. ALMs are a popular class of algorithms for solving constrained optimization problems. We demonstrate that, under mild assumptions, the sequences of iterates generated by ALMs converge to solutions of the “closest feasible problem”. We establish progressively stronger convergence results, ranging from basic sequence convergence to more precise convergence rates, under a hierarchy of assumptions. This study leverages the classical relationship between ALMs and the proximal-point algorithm applied to the dual problem. A key technical contribution is a set of concise results on the behavior of the proximal-point algorithm when applied to functions that may lack minimizers. These results pertain to its convergence in terms of its subgradients and of the values of the convex conjugate.
An algorithm based on the interior-point methodology for solving continuous nonlinearly constrained optimization problems is proposed, analyzed, and tested. The distinguishing feature of the algorithm is that it presumes that only noisy...
Introduced by Beck and Teboulle in [1], FISTA (Fast Iterative Shrinkage-Thresholding Algorithm) is a first-order method widely used in convex optimization. Adapted from Nesterov’s accelerated gradient method for convex functions [2],...
The progressive decoupling algorithm solves problems of optimization by iteratively suppressing complications coming from linear linkage relations. Here its formulation is significantly extended and a sharper theory of convergence is...
This paper introduces a class of two-stage stochastic minimax problems where the first-stage objective function is nonconvex-concave while the second-stage objective function is strongly convex-concave. We establish properties of the...
Inspired by Von Neumann’s foundational work on expected utility, this paper extends the data-driven expected utility maximization framework under constant absolute risk aversion (CARA) preferences by incorporating nonlinear payoff...