General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems (Q2419543): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 12:49, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems	scientific article

Statements

scholarly article

0 references

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

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

13 June 2019

0 references

zbMATH Keywords

nonconvex

0 references

nonsmooth

0 references

inertial proximal gradient method

0 references

Kurdyka-Łojasiewicz property

0 references

global convergence

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10589-019-00073-1

0 references

On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces

0 references

An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping

0 references

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

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization

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

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems

0 references

An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems

0 references

Proximal-gradient algorithms for fractional programming

0 references

Inertial Douglas-Rachford splitting for monotone inclusion problems

0 references

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

0 references

On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''

0 references

Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization

0 references

Convergence Rates in Forward--Backward Splitting

0 references

Sparse solutions to random standard quadratic optimization problems

0 references

Proximal Splitting Methods in Signal Processing

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Compressed sensing

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

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

0 references

Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming

0 references

Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs

0 references

DC programming: overview.

0 references

0 references

Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems

0 references

Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions

0 references

Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion

0 references

On gradients of functions definable in o-minimal structures

0 references

An inertial forward-backward algorithm for monotone inclusions

0 references

On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization

0 references

Error bounds and convergence analysis of feasible descent methods: A general approach

0 references

Convergence of one-step projected gradient methods for variational inequalities

0 references

Convergence of a splitting inertial proximal method for monotone operators

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Gradient methods for minimizing composite functions

0 references

iPiasco: inertial proximal algorithm for strongly convex optimization

0 references

iPiano: Inertial Proximal Algorithm for Nonconvex Optimization

0 references

Convex Optimization in Signal Processing and Communications

0 references

Some methods of speeding up the convergence of iteration methods

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

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

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10589-019-00073-1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2419543

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2419543&oldid=39070333"