The class of majorization–minimization algorithms is based on the principle of successively minimizing upper bounds of the objective function. Each upper bound, or surrogate function, is locally tight at the current estimate, and each minimization step decreases the value of the objective function. We present a majorization–minimization approach based on a novel convex–nonconvex upper bounding strategy for the solution of a certain class of nonconvex nonsmooth optimization problems. We propose an efficient algorithm for minimizing the (convex) surrogate function based on the alternating direction method of multipliers. A preliminary convergence analysis for the proposed approach is provided. Numerical experiments show the effectiveness of the proposed method for the solution of nonconvex nonsmooth minimization problems.

Lanza, A., Morigi, S., Selesnick, I., Sgallari, F. (2017). Nonconvex nonsmooth optimization via convex–nonconvex majorization–minimization. NUMERISCHE MATHEMATIK, 136(2), 343-381 [10.1007/s00211-016-0842-x].

Nonconvex nonsmooth optimization via convex–nonconvex majorization–minimization

LANZA, ALESSANDRO;MORIGI, SERENA;SGALLARI, FIORELLA
2017

Abstract

The class of majorization–minimization algorithms is based on the principle of successively minimizing upper bounds of the objective function. Each upper bound, or surrogate function, is locally tight at the current estimate, and each minimization step decreases the value of the objective function. We present a majorization–minimization approach based on a novel convex–nonconvex upper bounding strategy for the solution of a certain class of nonconvex nonsmooth optimization problems. We propose an efficient algorithm for minimizing the (convex) surrogate function based on the alternating direction method of multipliers. A preliminary convergence analysis for the proposed approach is provided. Numerical experiments show the effectiveness of the proposed method for the solution of nonconvex nonsmooth minimization problems.
2017
Lanza, A., Morigi, S., Selesnick, I., Sgallari, F. (2017). Nonconvex nonsmooth optimization via convex–nonconvex majorization–minimization. NUMERISCHE MATHEMATIK, 136(2), 343-381 [10.1007/s00211-016-0842-x].
Lanza, A.; Morigi, S; Selesnick, I.; Sgallari, F.
File in questo prodotto:
File Dimensione Formato  
CNC-MM_26_09_2016.pdf

accesso aperto

Tipo: Postprint
Licenza: Licenza per accesso libero gratuito
Dimensione 1.32 MB
Formato Adobe PDF
1.32 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/576284
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 48
  • ???jsp.display-item.citation.isi??? 44
social impact