Pages that link to "Item:Q346822"
From MaRDI portal
The following pages link to An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems (Q346822):
Displaying 50 items.
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions (Q285919) (← links)
- Asymptotics for some proximal-like method involving inertia and memory aspects (Q632230) (← links)
- Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data (Q683917) (← links)
- An inertial proximal-gradient penalization scheme for constrained convex optimization problems (Q684039) (← links)
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features (Q959923) (← links)
- New extragradient methods for solving variational inequality problems and fixed point problems (Q1615334) (← links)
- Modified Tseng's extragradient algorithms for variational inequality problems (Q1615363) (← links)
- An inertial-like proximal algorithm for equilibrium problems (Q1631179) (← links)
- Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
- Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms (Q1653320) (← links)
- An inertial method for solving split common fixed point problems (Q1684908) (← links)
- A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions (Q1684913) (← links)
- Inertial subgradient extragradient algorithms with line-search process for solving variational inequality problems and fixed point problems (Q1736410) (← links)
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
- Modified subgradient extragradient method for variational inequality problems (Q1785547) (← links)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
- A novel inertial projection and contraction method for solving pseudomonotone variational inequality problems (Q2023043) (← links)
- Strong convergence theorems for solving variational inequality problems with pseudo-monotone and non-Lipschitz operators (Q2031959) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- Inertial Tseng's extragradient method for solving variational inequality problems of pseudo-monotone and non-Lipschitz operators (Q2086955) (← links)
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems (Q2089886) (← links)
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
- New Tseng's extragradient methods for pseudomonotone variational inequality problems in Hadamard manifolds (Q2138433) (← links)
- Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics (Q2139279) (← links)
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems (Q2141356) (← links)
- Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization (Q2162532) (← links)
- New strong convergence theorem of the inertial projection and contraction method for variational inequality problems (Q2181650) (← links)
- A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem (Q2181667) (← links)
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects (Q2190750) (← links)
- New Tseng-degree gradient method in variational inequality problem (Q2196977) (← links)
- A new strong convergence for solving split variational inclusion problems (Q2220740) (← links)
- Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization (Q2228387) (← links)
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization (Q2235149) (← links)
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems (Q2307755) (← links)
- Strong convergence of extragradient methods with a new step size for solving variational inequality problems (Q2322785) (← links)
- Inertial proximal alternating minimization for nonconvex and nonsmooth problems (Q2406278) (← links)
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems (Q2419543) (← links)
- An improved inertial extragradient subgradient method for solving split variational inequality problems (Q2668223) (← links)
- Inertial viscosity iterative method for solving pseudo-monotone variational inequality problems and fixed point problems (Q2671554) (← links)
- The extragradient algorithm with inertial effects for solving the variational inequality (Q2836099) (← links)
- (Q3384230) (← links)
- A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem (Q3449576) (← links)
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization (Q3454490) (← links)
- A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function (Q4554100) (← links)
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano (Q4624932) (← links)
- Modified extragradient algorithms for solving equilibrium problems (Q4646541) (← links)
- A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space (Q4972912) (← links)
- (Q4995610) (← links)
- An inertial proximal alternating direction method of multipliers for nonconvex optimization (Q5031320) (← links)