scientific article; zbMATH DE number 3359250
From MaRDI portal
zbMath0226.47032MaRDI QIDQ5633161
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Fixed points and coincidences in algebraic topology (55M20)
Related Items
LQP method with a new optimal step size rule for nonlinear complementarity problems, Some results on a viscosity splitting algorithm in Hilbert spaces, Spherical nonspreadingness of resolvents of convex functions in geodesic spaces, Strict convex regularizations, proximal points and augmented lagrangians, Application of the dual active set algorithm to quadratic network optimization, Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems, Proximal methods avoid active strict saddles of weakly convex functions, Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry, On linear convergence of iterative methods for the variational inequality problem, Monotone operator theory in convex optimization, On the resolution of the variational inequalities of the first and the second kind as equations obtained by explicit Moreau-Yosida regularizations, Extended forward-backward algorithm, A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions, Locating Theorems of Differential Inclusions Governed by Maximally Monotone Operators, An asynchronous subgradient-proximal method for solving additive convex optimization problems, Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting, The Legendre Transformation in Modern Optimization, Unnamed Item, Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery, Deep neural network structures solving variational inequalities, Principled analyses and design of first-order methods with inexact proximal operators, Fejér-type iterative processes in the constrained quadratic minimization problem, Asymptotics for some proximal-like method involving inertia and memory aspects, Rescaled proximal methods for linearly constrained convex problems, A unified and tight linear convergence analysis of the relaxed proximal point algorithm, Iteration processes of convex programming with internal regularization, An inertial proximal algorithm with dry friction: finite convergence results, On the computation of equilibria in monotone and potential stochastic hierarchical games, New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks, Iterative Fejér processes in ill-posed problems, Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems, Unnamed Item, Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria, Weak convergence of an iterative algorithm for accretive operators, Modified Newton-type processes generating Fejér approximations of regularized solutions to nonlinear equations, Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems, A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints, A sparse proximal implementation of the LP dual active set algorithm, On the optimal linear convergence rate of a generalized proximal point algorithm, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Derivative-free optimization via proximal point methods, Self-adaptive inexact proximal point methods, Weak and strong convergence theorems for common zeros of accretive operators, A new relative error criterion for the proximal point algorithm, Strongly relatively nonexpansive sequences generated by firmly nonexpansive-like mappings, Some results on an infinite family of accretive operators in a reflexive Banach space, Partial inverse of a monotone operator, A new logarithmic-quadratic proximal method for nonlinear complementarity problems, Iterative processes of Fejér type in ill-posed problems with a priori information, A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems, Parallel proximal method of solving split system of fixed point set constraint minimization problems, Proximal method of solving split system of minimization problem, On Algorithms for Difference of Monotone Operators, On Algorithms for Difference of Monotone Operators, On the convergence of a multigrid method for Moreau-regularized variational inequalities of the second kind, A projection method for least-squares solutions to overdetermined systems of linear inequalities, An extension of Luque's growth condition, Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints, Designing Gabor windows using convex optimization, Convex programming algorithms using smoothing of exact penalty functions, Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization, A control-theoretic perspective on optimal high-order optimization, On finite convergence of proximal point algorithms for variational inequalities, On a decomposition formula for the resolvent operator of the sum of two set-valued maps with monotonicity assumptions, A primal-dual projection method for solving systems of linear inequalities, Applications of the method of partial inverses to convex programming: Decomposition, Error bounds and convergence analysis of feasible descent methods: A general approach, High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithm, Weak topology and Opial property in Wasserstein spaces, with applications to gradient flows and proximal point algorithms of geodesically convex functionals, On strongly quasiconvex functions: existence results and proximal point algorithms
