Pages that link to "Item:Q2757632"
From MaRDI portal
The following pages link to An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions (Q2757632):
Displaying 50 items.
- Hybrid iterative algorithms for two families of finite maximal monotone mappings (Q288179) (← links)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- A practical relative error criterion for augmented Lagrangians (Q378086) (← links)
- Hybrid extragradient method for generalized mixed equilibrium problems and fixed point problems in Hilbert space (Q400463) (← links)
- Interior proximal method without the cutting plane property (Q493039) (← links)
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming (Q507319) (← links)
- An inexact alternating direction method of multipliers with relative error criteria (Q519776) (← links)
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization (Q604261) (← links)
- New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems (Q613240) (← links)
- Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods (Q623551) (← links)
- Approximation of fixed points of weak Bregman relatively nonexpansive mappings in Banach spaces (Q638075) (← links)
- An interior proximal point algorithm for nonlinear complementarity problems (Q708086) (← links)
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators (Q721953) (← links)
- A new logarithmic-quadratic proximal method for nonlinear complementarity problems (Q732410) (← links)
- Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems (Q732657) (← links)
- Implicit iterative algorithms for asymptotically nonexpansive mappings in the intermediate sense and Lipschitz-continuous monotone mappings (Q848545) (← links)
- Proximal methods in reflexive Banach spaces without monotonicity (Q874955) (← links)
- On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators (Q929604) (← links)
- Approximate proximal algorithms for generalized variational inequalities with paramonotonicity and pseudomonotonicity (Q931762) (← links)
- An implicit iterative scheme for monotone variational inequalities and fixed point problems (Q949669) (← links)
- A generalized proximal-point-based prediction-correction method for variational inequality problems (Q950089) (← links)
- Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems (Q967247) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- Two extragradient methods for generalized mixed equilibrium problems, nonexpansive mappings and monotone mappings (Q979891) (← links)
- On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework (Q1026379) (← links)
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions (Q1035134) (← links)
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant (Q1037657) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- A strongly convergent hybrid proximal method in Banach spaces. (Q1425146) (← links)
- Nonlinear proximal decomposition method for convex programming (Q1594877) (← links)
- On the need for hybrid steps in hybrid proximal point methods (Q1604053) (← links)
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM (Q1659676) (← links)
- Accelerated schemes for a class of variational inequalities (Q1680963) (← links)
- Approximate ADMM algorithms derived from Lagrangian splitting (Q1687316) (← links)
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization (Q1695823) (← links)
- On inexact ADMMs with relative error criteria (Q1756581) (← links)
- Interior proximal method for variational inequalities: Case of nonparamonotone operators (Q1771256) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- A parameterized proximal point algorithm for separable convex optimization (Q1800446) (← links)
- Steered sequential projections for the inconsistent convex feasibility problem (Q1888607) (← links)
- An interior proximal method for a class of quasimonotone variational inequalities (Q1935257) (← links)
- Hybrid extragradient iterative algorithms for variational inequalities, variational inclusions, and fixed-point problems (Q1952987) (← links)
- Pseudomonotone operators and the Bregman proximal point algorithm (Q1959229) (← links)
- Efficient alternating minimization methods for variational edge-weighted colorization models (Q2000545) (← links)
- Convergence rates for an inexact ADMM applied to separable convex optimization (Q2023686) (← links)
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems (Q2067857) (← links)
- An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems (Q2088791) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects (Q2190750) (← links)