An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints

DOI10.1007/S10898-024-01382-4MaRDI QIDQ6593830

Dimitri Papadimitriou, Le Thi Khanh Hien

Publication date: 27 August 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

majorization minimizationalternating direction methods of multiplierslogistic matrix factorizationmultiblock nonconvex optimizationnonlinear coupling constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Smooth minimization of non-smooth functions
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• A coordinate gradient descent method for nonsmooth separable minimization
• Introductory lectures on convex optimization. A basic course.
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• Global convergence of ADMM in nonconvex nonsmooth optimization
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
• Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
• Proximal ADMM for nonconvex and nonsmooth optimization
• A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
• Inertial alternating direction method of multipliers for non-convex non-smooth optimization
• Nonlinear programming
• A unified convergence analysis of block successive minimization methods for nonsmooth optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• Stochastic Algorithms for Inverse Problems Involving PDEs and many Measurements
• Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
• Numerical methods for the nonlinear robust regression problem
• Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
• Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
• Block Bregman Majorization Minimization with Extrapolation
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
• Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
• On the Convergence of Block Coordinate Descent Type Methods
• Some methods of speeding up the convergence of iteration methods
• Heavy-ball method in nonconvex optimization problems

This page was built for publication: An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints

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