Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (Q530079): Difference between revisions
From MaRDI portal
Latest revision as of 22:23, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization |
scientific article |
Statements
Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (English)
0 references
9 June 2017
0 references
The authors present a majorization-minimization approach based on a novel convex-nonconvex upper bounding strategy for the solution of certain classes of nonconvex nonsmooth optimization problems. They propose an efficient algorithm for minimizing the (convex) surrogate function based on the alternating direction method of multipliers. Numerical experiments are given and show the effectiveness of the proposed method for the solution of nonconvex nonsmooth minimization problems.
0 references
nonconvex nonsmooth optimization
0 references
algorithm
0 references
alternating direction method of multipliers
0 references
numerical experiment
0 references
0 references
0 references
0 references
0 references