An Alternating Augmented Lagrangian method for constrained nonconvex optimization
From MaRDI portal
Publication:5113713
DOI10.1080/10556788.2019.1576177zbMath1441.49030OpenAlexW2911888267MaRDI QIDQ5113713
Matteo Lapucci, Tommaso Levato, Giulio Galvan, Marco Sciandrone
Publication date: 16 June 2020
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2019.1576177
global convergencedecompositionpenalty methodaugmented Lagrangianalternating direction method of multipliersnonconvex objective function
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A splitting method for orthogonality constrained problems
- Comparison of several fast algorithms for projection onto an ellipsoid
- An alternating direction algorithm for matrix completion with nonnegative factors
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Solving regularized linear least-squares problems by the alternating direction method with applications to image restoration
- 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
- Large-Scale Convex Optimization for Dense Wireless Cooperative Networks
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Alternating direction method of multipliers for real and complex polynomial optimization models
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Decomposition method with a variable parameter for a class of monotone variational inequality problems