Optimization Online


On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions and Algorithms

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

Abstract: We consider the problem of minimizing a general continuously differentiable function over symmetric sets under sparsity constraints. These type of problems are generally hard to solve as the sparsity constraint induces a combinatorial constraint into the problem, rendering the feasible set to be nonconvex. We begin with a study of the properties of the orthogonal projection operator onto sparse symmetric sets, which also results with efficient computation methods. We then introduce and study three types of optimality conditions: basic feasibility, $L$-stationarity and coordinate-wise optimality. A hierarchy between the optimality conditions is established by using the results derived on the orthogonal projection operator. Methods for generating points satisfying the various optimality conditions are presented, analyzed, and finally tested on specific applications.

Keywords: sparse projections, optimality condition, nonconvex optimization

Category 1: Nonlinear Optimization

Category 2: Global Optimization (Theory )

Citation: Accepted for publication in MOR

Download: [PDF]

Entry Submitted: 06/21/2014
Entry Accepted: 06/21/2014
Entry Last Modified: 05/01/2015

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