Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (Q530079)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization |
scientific article; zbMATH DE number 6728585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization |
scientific article; zbMATH DE number 6728585 |
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
0.96568984
0 references
0.9362525
0 references
0.92999613
0 references
0 references
0.92065847
0 references
0.9192062
0 references
0 references
