An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems (Q6164017): Difference between revisions

Latest revision as of 19:02, 30 December 2024

scientific article; zbMATH DE number 7719380

Language	Label	Description	Also known as
English	An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems	scientific article; zbMATH DE number 7719380

Statements

instance of

scholarly article

0 references

title

An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems (English)

0 references

0 references

0 references

0 references

0 references

Journal of Global Optimization

0 references

publication date

26 July 2023

0 references

zbMATH Keywords

nonconvex

0 references

nonsmooth

0 references

proximal iteratively reweighted method

0 references

extrapolation

0 references

Kurdyka-Łojasiewicz property

0 references

global convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-023-01299-4

0 references

cites work

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Clarke Subgradients of Stratifiable Functions

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions

0 references

Smoothing methods for nonsmooth, nonconvex minimization

0 references

Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration

0 references

Complexity of unconstrained $L_2 - L_p$ minimization

0 references

Convergence of the reweighted $\ell_1$ minimization algorithm for $\ell_2-\ell_p$ minimization

0 references

Optimization and nonsmooth analysis

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for $0<q\leqslant 1$

0 references

Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming

0 references

A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems

0 references

Q2933925

0 references

A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions

0 references

DC programming: overview.

0 references

$L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices

0 references

Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems

0 references

An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems

0 references

Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization

0 references

A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron

0 references

Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm

0 references

Q5405230

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Gradient methods for minimizing composite functions

0 references

iPiano: Inertial Proximal Algorithm for Nonconvex Optimization

0 references

On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision

0 references

Some methods of speeding up the convergence of iteration methods

0 references

Global convergence of proximal iteratively reweighted algorithm

0 references

Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems

0 references

Solving a class of linearly constrained indefinite quadratic problems by DC algorithms

0 references

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

0 references

Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems

0 references

On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems

0 references

A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation

0 references

10.1162/153244303322753751

0 references

General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems

0 references

Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems

0 references

Q2896066

0 references

Multi-stage convex relaxation for feature selection

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1007/S10898-023-01299-4

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6164017

@@ Property / DOI @@
-.1007/s10898-023-01299-4
@@ Property / DOI: 10.1007/s10898-023-01299-4 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10898-023-01299-4
@@ Property / DOI: 10.1007/S10898-023-01299-4 / rank @@
+Normal rank