Pages that link to "Item:Q1198734"
From MaRDI portal
The following pages link to On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators (Q1198734):
Displayed 50 items.
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces (Q596824) (← links)
- Application of the proximal point method to nonmonotone equilibrium problems (Q597173) (← links)
- Convergent algorithm based on progressive regularization for solving pseudomonotone variational inequalities (Q704729) (← links)
- Convergence of the approximate auxiliary problem method for solving generalized variational inequalities (Q704756) (← links)
- The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities (Q815484) (← links)
- Combined relaxation method for mixed equilibrium problems (Q852111) (← links)
- Proximal point algorithms and generalized nonlinear variational problems (Q884159) (← links)
- General variational inclusions in \(L^{p}\) spaces (Q884223) (← links)
- On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators (Q929604) (← links)
- On convergence criteria of generalized proximal point algorithms (Q929905) (← links)
- A modified inexact operator splitting method for monotone variational inequalities (Q934787) (← links)
- Convergence theorems for inertial KM-type algorithms (Q935781) (← links)
- On the difference of two maximal monotone operators: Regularization and algorithmic approaches (Q942362) (← links)
- The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications (Q945170) (← links)
- Sensitivity analysis for cocoercively monotone variational inclusions and \(( A , \eta)\)-maximal monotonicity (Q949258) (← links)
- Three-step iterative methods for general variational inclusions in \(L^p\) spaces (Q949319) (← links)
- An operator splitting method for variational inequalities with partially unknown mappings (Q998631) (← links)
- A generalized proximal point algorithm and implicit iterative schemes for a sequence of operators on Banach spaces (Q1005137) (← links)
- A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems (Q1021801) (← links)
- Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
- Progressive regularization of variational inequalities and decomposition algorithms (Q1265010) (← links)
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators (Q1265027) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- Parallel alternating direction multiplier decomposition of convex programs (Q1321443) (← links)
- Data parallel computing for network-structured optimization problems (Q1328430) (← links)
- A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895) (← links)
- Conditioning and regularization of nonsymmetric operators (Q1364222) (← links)
- Decomposition methods in stochastic programming (Q1365061) (← links)
- Finding a zero of the sum of two maximal monotone operators (Q1367726) (← links)
- New decomposition methods for solving variational inequality problems. (Q1410985) (← links)
- Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities (Q1573993) (← links)
- Solving variational inequality and fixed point problems by line searches and potential optimization (Q1764238) (← links)
- A relaxed approximate proximal point algorithm (Q1772967) (← links)
- Convergence of a splitting inertial proximal method for monotone operators (Q1811604) (← links)
- Generalized Mann iterates for constructing fixed points in Hilbert spaces (Q1856930) (← links)
- Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- Generalized proximal point algorithm for convex optimization (Q1908641) (← links)
- A parallel descent algorithm for convex programming (Q1908925) (← links)
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem (Q1919810) (← links)
- Self-adaptive projection method for co-coercive variational inequalities (Q2378448) (← links)
- A family of projective splitting methods for the sum of two maximal monotone operators (Q2467160) (← links)
- A hybrid proximal point algorithm based on the \((A,\eta )\)-maximal monotonicity framework (Q2469703) (← links)
- A new generalized APPA for maximal monotone operators (Q2469710) (← links)
- Approximation solvability of a class of nonlinear set-valued variational inclusions involving \((A,\eta )\)-monotone mappings (Q2473808) (← links)
- The proximal point method for nonmonotone variational inequalities (Q2474562) (← links)
- Rockafellar's celebrated theorem based on \(A\)-maximal monotonicity design (Q2483142) (← links)
- Generalized partially relaxed pseudomonotone variational inequalities and general auxiliary problem principle (Q2491544) (← links)
- Modified approximate proximal point algorithms for finding roots of maximal monotone operators (Q2501443) (← links)
- A splitting method for stochastic programs (Q2507416) (← links)