Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints
From MaRDI portal
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A block coordinate variable metric forward-backward algorithm
- A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
- A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- Block Bregman majorization minimization with extrapolation
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Efficiency of minimizing compositions of convex functions and smooth maps
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Global convergence of ADMM in nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 3724209 (Why is no real title available?)
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- Inexact reduced gradient methods in nonconvex optimization
- Introductory lectures on convex optimization. A basic course.
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Numerical methods for the nonlinear robust regression problem
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Relatively smooth convex optimization by first-order methods, and applications
- Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
- Stochastic algorithms for inverse problems involving PDEs and many measurements
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- Variational Analysis
This page was built for publication: Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848090)
