Add to ORKGBibliography: p. 56-57.Supported by the ITP Foundation, Madrid, Spain and the National Science Foundation under grant ECS 8217668by Javier Luque
During the last years, different modifications were introduced in the proximal point algorithm devel...
We glance at recent advances to the general theory of maximal (set-valued) monotone mappings and the...
Let H be a real Hilbert space and T be a maximal monotone operator on H. A well-known algorithm, dev...
Bibliography: p. 33-34."September, 1981."NSF Grant 79-20834by Fernando Javier Rodilla Luque
Bibliography: p. 33-34.Supported by the ITP Foundation, Madrid, Spain and the National Science Found...
The proximal point algorithm is a widely used tool for solving a variety of convex optimization prob...
We propose a modification of the classical proximal point algorithm for finding zeroes of a maximal ...
AbstractWe analyze some generalized proximal point algorithms which include the previously known pro...
AbstractIn this paper we introduce general iterative methods for finding zeros of a maximal monotone...
We propose a modification of the classical extragradient and proximal point algorithms for finding a...
This paper concerns with convergence properties of the classical proximal point algorithm for findin...
We propose a modification of the classical extragradient and proximal point algorithms for finding a...
AbstractIn this paper we introduce general iterative methods for finding zeros of a maximal monotone...
AbstractA general design for the Eckstein–Bertsekas proximal point algorithm, using the notion of th...
During the last years, different modifications were introduced in the proximal point algorithm devlo...
During the last years, different modifications were introduced in the proximal point algorithm devel...
We glance at recent advances to the general theory of maximal (set-valued) monotone mappings and the...
Let H be a real Hilbert space and T be a maximal monotone operator on H. A well-known algorithm, dev...
Bibliography: p. 33-34."September, 1981."NSF Grant 79-20834by Fernando Javier Rodilla Luque
Bibliography: p. 33-34.Supported by the ITP Foundation, Madrid, Spain and the National Science Found...
The proximal point algorithm is a widely used tool for solving a variety of convex optimization prob...
We propose a modification of the classical proximal point algorithm for finding zeroes of a maximal ...
AbstractWe analyze some generalized proximal point algorithms which include the previously known pro...
AbstractIn this paper we introduce general iterative methods for finding zeros of a maximal monotone...
We propose a modification of the classical extragradient and proximal point algorithms for finding a...
This paper concerns with convergence properties of the classical proximal point algorithm for findin...
We propose a modification of the classical extragradient and proximal point algorithms for finding a...
AbstractIn this paper we introduce general iterative methods for finding zeros of a maximal monotone...
AbstractA general design for the Eckstein–Bertsekas proximal point algorithm, using the notion of th...
During the last years, different modifications were introduced in the proximal point algorithm devlo...
During the last years, different modifications were introduced in the proximal point algorithm devel...
We glance at recent advances to the general theory of maximal (set-valued) monotone mappings and the...
Let H be a real Hilbert space and T be a maximal monotone operator on H. A well-known algorithm, dev...