Publication:5633161
From MaRDI portal
zbMath0226.47032MaRDI QIDQ5633161
Publication date: 1972
47H10: Fixed-point theorems
54H25: Fixed-point and coincidence theorems (topological aspects)
55M20: Fixed points and coincidences in algebraic topology
Related Items
Strict convex regularizations, proximal points and augmented lagrangians, Partial inverse of a monotone operator, Asymptotics for some proximal-like method involving inertia and memory aspects, A new logarithmic-quadratic proximal method for nonlinear complementarity problems, Iterative processes of Fejér type in ill-posed problems with a priori information, An extension of Luque's growth condition, A primal-dual projection method for solving systems of linear inequalities, Iteration processes of convex programming with internal regularization, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Error bounds and convergence analysis of feasible descent methods: A general approach, A projection method for least-squares solutions to overdetermined systems of linear inequalities, Convex programming algorithms using smoothing of exact penalty functions, On linear convergence of iterative methods for the variational inequality problem, Application of the dual active set algorithm to quadratic network optimization, An inertial proximal algorithm with dry friction: finite convergence results, New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks, A sparse proximal implementation of the LP dual active set algorithm, Self-adaptive inexact proximal point methods, A new relative error criterion for the proximal point algorithm, On finite convergence of proximal point algorithms for variational inequalities, Rescaled proximal methods for linearly constrained convex problems, Applications of the method of partial inverses to convex programming: Decomposition
