Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
From MaRDI portal
Publication:2425169
DOI10.1007/s10107-019-01365-4zbMath1426.90206OpenAlexW2901889632MaRDI QIDQ2425169
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
Related Items
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function, Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization, Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm, Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems, Zeroth-order single-loop algorithms for nonconvex-linear minimax problems, An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems, Stochastic approximation with discontinuous dynamics, differential inclusions, and applications, A variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraints, Global optimization for non-convex programs via convex proximal point method, Second-Order Guarantees of Distributed Gradient Algorithms, Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints, Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems, A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- Nearly unbiased variable selection under minimax concave penalty
- Penalized likelihood regression for generalized linear models with non-quadratic penalties
- On the linear convergence of the alternating direction method of multipliers
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- Implementing proximal point methods for linear programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Introductory lectures on convex optimization. A basic course.
- Global convergence of ADMM in nonconvex nonsmooth optimization
- An inexact modified subgradient algorithm for nonconvex optimization
- Approximate KKT points and a proximity measure for termination
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Multiplier and gradient methods
- An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization
- Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
- Decomposition Methods Based on Augmented Lagrangians: A Survey
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Distributed Optimization Over Time-Varying Directed Graphs
- Multiuser Optimization: Distributed Algorithms and Error Analysis
- Alternating direction methods for classical and ptychographic phase retrieval
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Numerical Optimization
- Statistical Methods for Rates and Proportions
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- Coding With Side Information for Rate-Constrained Consensus
- Distributed Sparse Linear Regression
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Optimal Resource Allocation in Coordinated Multi-Cell Systems
- Distributed Subgradient Methods for Multi-Agent Optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- ZONE: Zeroth-Order Nonconvex Multiagent Optimization Over Networks
- Statistics for Spatial Data
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- Decentralized Learning for Wireless Communications and Networking
- Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
- Sparse Approximation via Penalty Decomposition Methods
- Practical Augmented Lagrangian Methods for Constrained Optimization
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- On sequential optimality conditions for smooth constrained optimization
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
