An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
From MaRDI portal
Publication:2226322
DOI10.1016/J.CAM.2021.113384zbMATH Open1459.90165OpenAlexW3120796151MaRDI QIDQ2226322FDOQ2226322
Zehui Jia, Jieru Huang, Zhongming Wu
Publication date: 12 February 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2021.113384
Recommendations
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Nonconvex Sparse Logistic Regression With Weakly Convex Regularization
- Converting ADMM to a proximal gradient for efficient sparse estimation
- Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- Proximal ADMM for nonconvex and nonsmooth optimization
- Inertial proximal incremental aggregated gradient method with linear convergence guarantees
- Inertial proximal ADMM for linearly constrained separable convex optimization
alternating direction method of multipliersnonconvex optimizationglobal convergenceincremental aggregated proximal methodKurdyka-Łojasiewicz property
Cites Work
- 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
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Title not available (Why is that?)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Introductory lectures on convex optimization. A basic course.
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Title not available (Why is that?)
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Title not available (Why is that?)
- A Convergent Incremental Gradient Method with a Constant Step Size
- Title not available (Why is that?)
- On gradients of functions definable in o-minimal structures
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- An efficient nonconvex regularization for wavelet frame and total variation based image restoration
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- Nonconvex Sparse Logistic Regression With Weakly Convex Regularization
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Solving a non-smooth eigenvalue problem using operator-splitting methods
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Linearized block-wise alternating direction method of multipliers for multiple-block convex programming
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
- A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods
Cited In (6)
- Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming
- Splitting augmented Lagrangian-type algorithms with partial quadratic approximation to solve sparse signal recovery problems
- A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization
- A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- An iterative method based on ADMM for solving generalized Sylvester matrix equations
This page was built for publication: An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226322)
