Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
From MaRDI portal
Publication:2425169
DOI10.1007/S10107-019-01365-4zbMATH Open1426.90206OpenAlexW2901889632MaRDI QIDQ2425169FDOQ2425169
Davood Hajinezhad, Mingyi Hong
Publication date: 26 June 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-019-01365-4
Recommendations
- Dualize, split, randomize: toward fast nonsmooth optimization algorithms
- An efficient primal dual prox method for non-smooth optimization
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Primal-dual incremental gradient method for nonsmooth and convex optimization problems
Cites Work
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Nearly unbiased variable selection under minimax concave penalty
- Numerical Optimization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introductory lectures on convex optimization. A basic course.
- On the global and linear convergence of the generalized alternating direction method of multipliers
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- Statistics for Spatial Data
- Title not available (Why is that?)
- Multiplier and gradient methods
- Title not available (Why is that?)
- Penalized likelihood regression for generalized linear models with non-quadratic penalties
- Multiuser Optimization: Distributed Algorithms and Error Analysis
- Alternating direction methods for classical and ptychographic phase retrieval
- Nonlinear optimization.
- Title not available (Why is that?)
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- Constrained Consensus and Optimization in Multi-Agent Networks
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- Distributed Sparse Linear Regression
- Distributed Subgradient Methods for Multi-Agent Optimization
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Sparse Approximation via Penalty Decomposition Methods
- Title not available (Why is that?)
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- On the linear convergence of the alternating direction method of multipliers
- On sequential optimality conditions for smooth constrained optimization
- Statistical Methods for Rates and Proportions
- Distributed Optimization Over Time-Varying Directed Graphs
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- An inexact modified subgradient algorithm for nonconvex optimization
- Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
- Coding With Side Information for Rate-Constrained Consensus
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Decentralized Learning for Wireless Communications and Networking
- Approximate KKT points and a proximity measure for termination
- Implementing proximal point methods for linear programming
- Optimal Resource Allocation in Coordinated Multi-Cell Systems
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
- Decomposition Methods Based on Augmented Lagrangians: A Survey
- ZONE: Zeroth-Order Nonconvex Multiagent Optimization Over Networks
Cited In (18)
- Stochastic approximation with discontinuous dynamics, differential inclusions, and applications
- Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems
- Second-Order Guarantees of Distributed Gradient Algorithms
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
- An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- A variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraints
- Global optimization for non-convex programs via convex proximal point method
- An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
- A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- Dual descent augmented Lagrangian method and alternating direction method of multipliers
- Derivative-free alternating projection algorithms for general nonconvex-concave minimax problems
Uses Software
This page was built for publication: Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425169)
