The following pages link to (Q4252814):
Displaying 23 items.
- A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator (Q276854) (← links)
- On a sufficient condition for equality of two maximal monotone operators (Q618875) (← links)
- Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods (Q730193) (← links)
- A new inertial-type hybrid projection-proximal algorithm for monotone inclusions (Q846404) (← links)
- An additive subfamily of enlargements of a maximally monotone operator (Q904307) (← links)
- On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators (Q929604) (← links)
- Natural closures, natural compositions and natural sums of monotone operators (Q930280) (← links)
- Enlargements of positive sets (Q1023028) (← links)
- On Bregman-type distances for convex functions and maximally monotone operators (Q1653330) (← links)
- On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators (Q1670016) (← links)
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization (Q1695823) (← links)
- The relevance of convex analysis for the study of monotonicity (Q1883100) (← links)
- An inexact ADMM with proximal-indefinite term and larger stepsize (Q2106244) (← links)
- A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives (Q2165600) (← links)
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects (Q2190750) (← links)
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis (Q2317847) (← links)
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions (Q2322832) (← links)
- Projective method of multipliers for linearly constrained convex minimization (Q2419546) (← links)
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework (Q2968178) (← links)
- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM (Q5221273) (← links)
- Enlargements and sums of monotone operators (Q5957792) (← links)
- Robustness of the hybrid extragradient proximal-point algorithm. (Q5958079) (← links)
- Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
