An alternating augmented Lagrangian method for constrained nonconvex optimization
From MaRDI portal
Publication:5113713
Recommendations
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- A new alternating direction method for linearly constrained nonconvex optimization problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- A splitting method for orthogonality constrained problems
- Alternating direction method of multipliers for real and complex polynomial optimization models
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- An alternating direction algorithm for matrix completion with nonnegative factors
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Comparison of several fast algorithms for projection onto an ellipsoid
- Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Large-Scale Convex Optimization for Dense Wireless Cooperative Networks
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Practical augmented Lagrangian methods for constrained optimization
- Solving regularized linear least-squares problems by the alternating direction method with applications to image restoration
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
Cited in
(13)- Constrained composite optimization and augmented Lagrangian methods
- Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- Inexact penalty decomposition methods for optimization problems with geometric constraints
- Dual descent augmented Lagrangian method and alternating direction method of multipliers
- An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints
- A nonlinear augmented Lagrangian for constrained minimax problems
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems
This page was built for publication: An alternating augmented Lagrangian method for constrained nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113713)
