Asymptotics for some proximal-like method involving inertia and memory aspects
From MaRDI portal
Publication:632230
Recommendations
- Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- Convergence rates of inertial forward-backward algorithms
Cites work
- scientific article; zbMATH DE number 3737398 (Why is no real title available?)
- scientific article; zbMATH DE number 125245 (Why is no real title available?)
- scientific article; zbMATH DE number 3234861 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- A method of projection onto an acute cone with level control in convex minimization
- An inertial proximal algorithm with dry friction: finite convergence results
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Asymptotics for a gradient system with memory term
- Convergence of New Inertial Proximal Methods for DC Programming
- Convergence of a splitting inertial proximal method for monotone operators
- Convex Analysis
- Monotone Operators and the Proximal Point Algorithm
- NUMERICAL APPROACH TO A STATIONARY SOLUTION OF A SECOND ORDER DISSIPATIVE DYNAMICAL SYSTEM
- Obtuse cones and Gram matrices with non-negative inverse
- On the Long Time Behavior of Second Order Differential Equations with Asymptotically Small Dissipation
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- On the long time behavior of second order differential equations with asymptotically small dissipation
- Reflection-projection method for convex feasibility problems with an obtuse cone
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- The Relaxation Method for Solving Systems of Linear Inequalities
- Variational Analysis
Cited in
(15)- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- New inertial factors of the Krasnosel'skiĭ-Mann iteration
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients
- Sequential formulae for the normal cone to sublevel sets
- Convergence rates of inertial forward-backward algorithms
- Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
- An inertial proximal-gradient penalization scheme for constrained convex optimization problems
- A Hybrid Proximal-Extragradient Algorithm with Inertial Effects
- Asymptotics for a gradient system with memory term
- Proximal primal-dual best approximation algorithm with memory
- Convergence of a relaxed inertial proximal algorithm for maximally monotone operators
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Penalty schemes with inertial effects for monotone inclusion problems
This page was built for publication: Asymptotics for some proximal-like method involving inertia and memory aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632230)
