A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints

DOI10.1007/S10957-021-01929-5zbMATH Open1492.90133OpenAlexW3199936146MaRDI QIDQ2139259FDOQ2139259

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

zbMATH Keywords

proximal gradient methodglobal convergenceKurdyka-Lojasiewicz propertyaugmented Lagrangian-based methodsnonconvex and nonsmooth minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Variational Analysis
• Multiplier and gradient methods
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Lipschitz functions
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• Variational Analysis and Applications
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
• Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
• A simplified view of first order methods for optimization
• The landscape of empirical risk for nonconvex losses
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
• Lagrangian methods for composite optimization

Cited In (5)

• Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
• An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
• A stochastic moving ball approximation method for smooth convex constrained minimization
• A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
• Convergence properties of monotone and nonmonotone proximal gradient methods revisited

This page was built for publication: A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139259)