An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
From MaRDI portal
Publication:2226322
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
Cites work
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- A Convergent Incremental Gradient Method with a Constant Step Size
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- An efficient nonconvex regularization for wavelet frame and total variation based image restoration
- An improved GLMNET for L1-regularized logistic regression
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- Global convergence rate of proximal incremental aggregated gradient methods
- Introductory lectures on convex optimization. A basic course.
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Linearized block-wise alternating direction method of multipliers for multiple-block convex programming
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Nonconvex Sparse Logistic Regression With Weakly Convex Regularization
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- On gradients of functions definable in o-minimal structures
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- 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
- Solving a non-smooth eigenvalue problem using operator-splitting methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
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)