Penalty dual decomposition method with application in signal processing
Authors:
- 1 March 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 54, 4059-4063
Abstract
Many problems of recent interest in signal processing, machine learning and wireless communications can be posed as nonconvex nonsmooth optimization problems. These problems are generally difficult to solve especially when the optimization variables are nonlinearly coupled in some nonconvex constraints. In this paper, we propose an algorithm named “penalty dual decomposition” (PDD) method, for the minimization of a nonconvex nonsmooth objective subject to nonconvex constraints. We show that the PDD converges to KKT solutions under certain constraint qualification condition. Simulations corroborate the excellent performance of the PDD method.Keywords
This publication has 27 references indexed in Scilit:
- Penalty decomposition methods for rank minimizationOptimization Methods and Software, 2014
- Sparse Approximation via Penalty Decomposition MethodsSIAM Journal on Optimization, 2013
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth OptimizationSIAM Journal on Optimization, 2013
- An alternating direction algorithm for matrix completion with nonnegative factorsFrontiers of Mathematics in China, 2012
- Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality ConditionSIAM Journal on Optimization, 2012
- On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliersMathematical Programming, 2009
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse RepresentationIEEE Transactions on Signal Processing, 2006
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear OptimizationSIAM Journal on Optimization, 2005
- Optimality Conditions for Irregular Inequality-Constrained ProblemsSIAM Journal on Control and Optimization, 2002
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969