AbstractA general framework for a hybrid proximal point algorithm using the notion of (A,η)-monotonicity is developed. Convergence analysis for this algorithm in the context of solving a class of nonlinear inclusion problems is explored along with some results on the resolvent operator corresponding to (A,η)-monotonicity
We glance at recent advances to the general theory of maximal (set-valued) monotone mappings and the...
AbstractLet H be a real Hilbert space and let T:H→2H be a maximal monotone operator. In this paper, ...
AbstractFirst the general framework for a generalized over-relaxed proximal point algorithm using th...
AbstractA new relaxed algorithmic procedure based on the notion of A-maximal relaxed monotonicity is...
AbstractFirst, a general framework for the over-relaxed A-proximal point algorithm based on the A-ma...
AbstractA generalization to Rockafellar’s theorem (1976) in the context of approximating a solution ...
AbstractA general design for the Eckstein–Bertsekas proximal point algorithm, using the notion of th...
AbstractA general framework for a hybrid proximal point algorithm using the notion of (A,η)-monotoni...
A general framework for a hybrid proximal point algorithm using the notion of (A, eta)-monotonicity ...
AbstractIn this paper we introduce general iterative methods for finding zeros of a maximal monotone...
AbstractBased on the notion of the A-monotonicity, the solvability of a class of nonlinear variation...
AbstractWe analyze some generalized proximal point algorithms which include the previously known pro...
AbstractIn this paper, the Resolvent–Projection algorithm for solving the variational inclusion 0∈M(...
Abstract. In this paper, three-step hybrid proximal point algorithm is suggested and analyzed for fi...
We glance at recent advances to the general theory of maximal set-valued monotone mappings and thei...
We glance at recent advances to the general theory of maximal (set-valued) monotone mappings and the...
AbstractLet H be a real Hilbert space and let T:H→2H be a maximal monotone operator. In this paper, ...
AbstractFirst the general framework for a generalized over-relaxed proximal point algorithm using th...
AbstractA new relaxed algorithmic procedure based on the notion of A-maximal relaxed monotonicity is...
AbstractFirst, a general framework for the over-relaxed A-proximal point algorithm based on the A-ma...
AbstractA generalization to Rockafellar’s theorem (1976) in the context of approximating a solution ...
AbstractA general design for the Eckstein–Bertsekas proximal point algorithm, using the notion of th...
AbstractA general framework for a hybrid proximal point algorithm using the notion of (A,η)-monotoni...
A general framework for a hybrid proximal point algorithm using the notion of (A, eta)-monotonicity ...
AbstractIn this paper we introduce general iterative methods for finding zeros of a maximal monotone...
AbstractBased on the notion of the A-monotonicity, the solvability of a class of nonlinear variation...
AbstractWe analyze some generalized proximal point algorithms which include the previously known pro...
AbstractIn this paper, the Resolvent–Projection algorithm for solving the variational inclusion 0∈M(...
Abstract. In this paper, three-step hybrid proximal point algorithm is suggested and analyzed for fi...
We glance at recent advances to the general theory of maximal set-valued monotone mappings and thei...
We glance at recent advances to the general theory of maximal (set-valued) monotone mappings and the...
AbstractLet H be a real Hilbert space and let T:H→2H be a maximal monotone operator. In this paper, ...
AbstractFirst the general framework for a generalized over-relaxed proximal point algorithm using th...
DOI
Add to ORKG