Pages that link to "Item:Q285919"
From MaRDI portal
The following pages link to An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions (Q285919):
Displaying 49 items.
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula (Q2691372) (← links)
- An abstract convergence framework with application to inertial inexact forward-backward methods (Q2696904) (← links)
- On the convergence of the forward–backward splitting method with linesearches (Q2829582) (← links)
- The extragradient algorithm with inertial effects for solving the variational inequality (Q2836099) (← links)
- Inertial forward–backward methods for solving vector optimization problems (Q3177614) (← 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)
- Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity (Q4558504) (← links)
- Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms (Q4586171) (← links)
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems (Q4602329) (← 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)
- Sequence Convergence of Inexact Nonconvex and Nonsmooth Algorithms with More Realistic Assumptions (Q4985183) (← links)
- An inertial proximal alternating direction method of multipliers for nonconvex optimization (Q5031320) (← links)
- Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (Q5037570) (← links)
- Convergence analysis of new inertial method for the split common null point problem (Q5054733) (← links)
- (Q5075972) (← links)
- A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization (Q5081096) (← links)
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates (Q5119852) (← links)
- Approximating solutions of split equality of some nonlinear optimization problems using an inertial algorithm (Q5140428) (← links)
- Inertial extragradient method via viscosity approximation approach for solving equilibrium problem in Hilbert space (Q5151543) (← links)
- A forward–backward penalty scheme with inertial effects for monotone inclusions. Applications to convex bilevel programming (Q5197994) (← links)
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems (Q5231666) (← links)
- New algorithms for the split variational inclusion problems and application to split feasibility problems (Q5238200) (← links)
- Penalty schemes with inertial effects for monotone inclusion problems (Q5277990) (← links)
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
- Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction (Q5860374) (← links)
- (Q5863257) (← links)
- (Q5868602) (← links)
- Nonconvex optimization with inertial proximal stochastic variance reduction gradient (Q6052662) (← links)
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions (Q6071886) (← links)
- An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems (Q6138306) (← links)
- Inertial Newton algorithms avoiding strict saddle points (Q6145046) (← links)
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality (Q6161313) (← links)
- A forward-backward algorithm with different inertial terms for structured non-convex minimization problems (Q6163956) (← links)
- An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems (Q6164017) (← links)
- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations (Q6165597) (← links)
- Fast optimization via inertial dynamics with closed-loop damping (Q6172672) (← links)
- A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems (Q6184273) (← links)
- Convergence Analysis for Bregman Iterations in Minimizing a Class of Landau Free Energy Functionals (Q6194524) (← links)
- A parameterized three-operator splitting algorithm for non-convex minimization problems with applications (Q6561488) (← links)
- Three remarks on the convergence of some discretized second order gradient-like systems (Q6565519) (← links)
- Fast optimization of charged particle dynamics with damping (Q6573013) (← links)
- Extrapolated plug-and-play three-operator splitting methods for nonconvex optimization with applications to image restoration (Q6587639) (← links)
- A Levenberg-Marquardt method for nonsmooth regularized least squares (Q6590132) (← links)
- A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems (Q6593828) (← links)
- Two-step inertial Tseng’s extragradient method for solving quasimonotone variational inequalities (Q6608742) (← links)
- Sequential inertial linear ADMM algorithm for nonconvex and nonsmooth multiblock problems with nonseparable structure (Q6609590) (← links)