Pages that link to "Item:Q3862353"
From MaRDI portal
The following pages link to Splitting Algorithms for the Sum of Two Nonlinear Operators (Q3862353):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- A note on the complexity of proximal iterative hard thresholding algorithm (Q259117) (← links)
- Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem (Q259135) (← links)
- Splitting-midpoint method for zeros of the sum of accretive operator and \(\mu\)-inversely strongly accretive operator in a \(q\)-uniformly smooth Banach space and its applications (Q264521) (← links)
- A modified regularization method for finding zeros of monotone operators in Hilbert spaces (Q264965) (← links)
- Some results on a viscosity splitting algorithm in Hilbert spaces (Q265229) (← links)
- Ergodicity of the implicit midpoint rule for nonexpansive mappings (Q265234) (← links)
- The error structure of the Douglas-Rachford splitting method for stiff linear problems (Q269375) (← links)
- A new iterative algorithm for the sum of infinite \(m\)-accretive mappings and infinite \(\mu_{i}\)-inversely strongly accretive mappings and its applications to integro-differential systems (Q269953) (← links)
- New properties of forward-backward splitting and a practical proximal-descent algorithm (Q274940) (← links)
- On the order of the operators in the Douglas-Rachford algorithm (Q279805) (← links)
- A generalized forward-backward splitting method for solving quasi inclusion problems in Banach spaces (Q281480) (← links)
- Parallel algorithms for variational inclusions and fixed points with applications (Q286571) (← links)
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232) (← links)
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530) (← links)
- Stochastic forward-backward splitting for monotone inclusions (Q289110) (← links)
- Strong convergence of a regularization algorithm for common solutions with applications (Q291378) (← links)
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints (Q291885) (← links)
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems (Q295005) (← links)
- Douglas-Rachford splitting method for semidefinite programming (Q295495) (← links)
- Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing (Q295499) (← links)
- Inertial Douglas-Rachford splitting for monotone inclusion problems (Q299664) (← links)
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces (Q300769) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
- Convergence rates with inexact non-expansive operators (Q312687) (← links)
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere (Q313401) (← links)
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints (Q323195) (← links)
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems (Q334266) (← links)
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity (Q334319) (← links)
- Fast solution of Cahn-Hilliard variational inequalities using implicit time discretization and finite elements (Q348832) (← links)
- The Wiener-Hopf equation technique for solving general nonlinear regularized nonconvex variational inequalities (Q359917) (← links)
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms (Q368722) (← links)
- Proximal point algorithms for finding a zero of a finite sum of monotone mappings in Banach spaces (Q369787) (← links)
- Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
- Piecewise constant level set method for structural topology optimization with {MBO} type of projection (Q381642) (← links)
- Most maximally monotone operators have a unique zero and a super-regular resolvent (Q393212) (← links)
- On solutions of inclusion problems and fixed point problems (Q395225) (← links)
- Image segmentation using Euler's elastica as the regularization (Q395364) (← links)
- Algorithms for solutions of extended general mixed variational inequalities and fixed points (Q395865) (← links)
- A new iterative algorithm for mean curvature-based variational image denoising (Q398633) (← links)
- A direct splitting method for nonsmooth variational inequalities (Q398641) (← links)
- Combined methods for dynamic spatial auction market models (Q400025) (← links)
- A monotone projection algorithm for fixed points of nonlinear operators (Q401792) (← links)
- Common fixed points of a family of strictly pseudocontractive mappings (Q401825) (← links)
- Operator splittings, Bregman methods and frame shrinkage in image processing (Q408893) (← links)
- A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography (Q427195) (← links)
