Optimization Online


An Augmented Lagrangian Proximal Alternating Method for Sparse Discrete Optimization Problems

Yue Teng(tengyue86***at***mail.dlut.edu.cn )
Li Yang(yangli96***at***dlut.edu.cn)
Bo Yu(yubo***at***dlut.edu.cn)
Xiaoliang Song(songxiaoliang***at***mail.dlut.edu.cn)

Abstract: In this paper, an augmented Lagrangian proximal alternating (ALPA) method is proposed for two class of large-scale sparse discrete constrained optimization problems in which a sequence of augmented Lagrangian subproblems are solved by utilizing proximal alternating linearized minimization framework and sparse projection techniques. Under the Mangasarian-Fromovitz and the basic constraint qualification, we show that any local minimizer is a Karush-Kuhn-Tuker (KKT) point of the problem. And under some suitable assumptions, any accumulation point of the sequence generated by the ALPA method is a KKT point or a local minimizer of the original problem. The computational results with practical problems demonstrate that our method can find the suboptimal solutions of the problems efficiently and is competitive with some other local solution methods.

Keywords: Discrete constrained optimization · l_0 minimization · Proximal alternating linearized minimization method · Augmented Lagrangian method · Sparse projection

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 2: Applications -- OR and Management Sciences (Finance and Economics )

Category 3: Combinatorial Optimization (Approximation Algorithms )

Citation: Submitted: 10/30/2016

Download: [PDF]

Entry Submitted: 02/28/2017
Entry Accepted: 02/28/2017
Entry Last Modified: 02/28/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