Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization
Authors:
- 20 February 2019
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 176 (1-2) , 207-245
Abstract
No abstract availableKeywords
Funding Information
- Directorate for Engineering (CMMI-1727757)
This publication has 52 references indexed in Scilit:
- Alternating direction method of multipliers for penalized zero-variance discriminant analysisComputational Optimization and Applications, 2016
- Adaptive augmented Lagrangian methods: algorithms and practical numerical experienceOptimization Methods and Software, 2015
- Practical Augmented Lagrangian Methods for Constrained Optimization2014
- Optimal Resource Allocation in Coordinated Multi-Cell SystemsFoundations and Trends® in Communications and Information Theory, 2013
- Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex OptimizationIEEE Transactions on Automatic Control, 2012
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- On sequential optimality conditions for smooth constrained optimizationOptimization, 2011
- Penalized likelihood regression for generalized linear models with non-quadratic penaltiesAnnals of the Institute of Statistical Mathematics, 2009
- An inexact modified subgradient algorithm for nonconvex optimizationComputational Optimization and Applications, 2008
- A Direct Formulation for Sparse PCA Using Semidefinite ProgrammingSIAM Review, 2007