An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems
From MaRDI portal
Publication:6164017
Recommendations
- An inexact regularized proximal Newton-type method for nonconvex composite optimization problems
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- Inertial proximal alternating minimization for nonconvex and nonsmooth problems
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
Cites work
- scientific article; zbMATH DE number 6276219 (Why is no real title available?)
- 10.1162/153244303322753751
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Analysis of multi-stage convex relaxation for sparse regularization
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- Clarke Subgradients of Stratifiable Functions
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Convex analysis and monotone operator theory in Hilbert spaces
- DC programming: overview.
- Distributed stochastic inertial-accelerated methods with delayed derivatives for nonconvex problems
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Global convergence of proximal iteratively reweighted algorithm
- Gradient methods for minimizing composite functions
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Introductory lectures on convex optimization. A basic course.
- Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Multi-stage convex relaxation for feature selection
- Multi-stage multi-task feature learning
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
- Optimization and nonsmooth analysis
- 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
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Signal Recovery by Proximal Forward-Backward Splitting
- Smoothing methods for nonsmooth, nonconvex minimization
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Some methods of speeding up the convergence of iteration methods
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- iPiano: inertial proximal algorithm for nonconvex optimization
Cited in
(1)
This page was built for publication: An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164017)
