A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
From MaRDI portal
Publication:2139259
DOI10.1007/s10957-021-01929-5zbMath1492.90133OpenAlexW3199936146MaRDI QIDQ2139259
Marc Teboulle, Eyal Cohen, Nadav Hallak
Publication date: 17 May 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01929-5
global convergenceproximal gradient methodKurdyka-Lojasiewicz propertyaugmented Lagrangian-based methodsnonconvex and nonsmooth minimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions, A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem, Convergence properties of monotone and nonmonotone proximal gradient methods revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A simplified view of first order methods for optimization
- Lipschitz functions
- The landscape of empirical risk for nonconvex losses
- Multiplier and gradient methods
- Lagrangian methods for composite optimization
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis and Applications
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
