Optimization Online


Optimization Problems Involving Group Sparsity Terms

Amir Beck(becka***at***ie.technion.ac.il)
Nadav Hallak(nadav_hallak***at***outlook.com)

Abstract: This paper studies a general form problem in which a lower bounded continuously differentiable function is minimized over a block separable set incorporating a group sparsity expression as a constraint or a penalty (or both) in the group sparsity setting. This class of problems is generally hard to solve, yet highly applicable in numerous practical settings. Particularly, we study the proximal mapping that includes group-sparsity terms, and derive an efficient method to compute it. Necessary optimality conditions for the problem are devised, and a hierarchy between stationary-based and coordinate-wised based conditions is established. Methods that obtain points satisfying the optimality conditions are presented, analyzed and tested in applications from the fields of investment and graph theory.

Keywords: group sparsity; nonconvex optimization; proximal mapping; stationarity; coordinate-based methods

Category 1: Nonlinear Optimization


Download: [PDF]

Entry Submitted: 05/18/2017
Entry Accepted: 05/18/2017
Entry Last Modified: 05/18/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society