Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
From MaRDI portal
Publication:2425169
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
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- Alternating direction methods for classical and ptychographic phase retrieval
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- An inexact modified subgradient algorithm for nonconvex optimization
- Approximate KKT points and a proximity measure for termination
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Coding With Side Information for Rate-Constrained Consensus
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- Constrained Consensus and Optimization in Multi-Agent Networks
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
- Decentralized learning for wireless communications and networking
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Decomposition methods based on augmented Lagrangians: a survey
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Sparse Linear Regression
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- Implementing proximal point methods for linear programming
- Introductory lectures on convex optimization. A basic course.
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- Multiplier and gradient methods
- Multiuser optimization: distributed algorithms and error analysis
- Nearly unbiased variable selection under minimax concave penalty
- Nonlinear optimization.
- Numerical Optimization
- On sequential optimality conditions for smooth constrained optimization
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the linear convergence of the alternating direction method of multipliers
- Optimal Resource Allocation in Coordinated Multi-Cell Systems
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Penalized likelihood regression for generalized linear models with non-quadratic penalties
- Practical augmented Lagrangian methods for constrained optimization
- Sparse Approximation via Penalty Decomposition Methods
- Statistical Methods for Rates and Proportions
- Statistics for spatial data
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- ZONE: Zeroth-Order Nonconvex Multiagent Optimization Over Networks
Cited in
(22)- Stochastic approximation with discontinuous dynamics, differential inclusions, and applications
- A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization
- Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
- First-order primal-dual methods for nonsmooth non-convex optimization
- 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
- Global optimization for non-convex programs via convex proximal point method
- A variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraints
- An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
- Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
- Proximal gradient methods with adaptive subspace sampling
- An efficient primal dual prox method for non-smooth optimization
- Second-order guarantees of distributed gradient algorithms
- 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
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)
