scientific article; zbMATH DE number 3359250
From MaRDI portal
Publication:5633161
zbMATH Open0226.47032MaRDI QIDQ5633161FDOQ5633161
Authors: B. Martinet 
Publication date: 1972
Title of this publication is not available (Why is that?)
Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Fixed points and coincidences in algebraic topology (55M20)
Cited In (78)
- An inertial proximal algorithm with dry friction: finite convergence results
- Locating Theorems of Differential Inclusions Governed by Maximally Monotone Operators
- 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
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- Rescaled proximal methods for linearly constrained convex problems
- Applications of the method of partial inverses to convex programming: Decomposition
- Parallel proximal method of solving split system of fixed point set constraint minimization problems
- On Algorithms for Difference of Monotone Operators
- Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems
- Asymptotics for some proximal-like method involving inertia and memory aspects
- Extended forward-backward algorithm
- Weak topology and Opial property in Wasserstein spaces, with applications to gradient flows and proximal point algorithms of geodesically convex functionals
- A new logarithmic-quadratic proximal method for nonlinear complementarity problems
- Weak convergence of an iterative algorithm for accretive operators
- Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems
- An extension of Luque's growth condition
- Designing Gabor windows using convex optimization
- Proximal activation of smooth functions in splitting algorithms for convex image recovery
- Deep neural network structures solving variational inequalities
- Partial inverse of a monotone operator
- On algorithms for difference of monotone operators
- A primal-dual projection method for solving systems of linear inequalities
- Proximal methods avoid active strict saddles of weakly convex functions
- Iteration processes of convex programming with internal regularization
- Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry
- On linear convergence of iterative methods for the variational inequality problem
- Iterative Fejér processes in ill-posed problems
- On the resolution of the variational inequalities of the first and the second kind as equations obtained by explicit Moreau-Yosida regularizations
- Some results on an infinite family of accretive operators in a reflexive Banach space
- Strict convex regularizations, proximal points and augmented lagrangians
- On the optimal linear convergence rate of a generalized proximal point algorithm
- The Legendre transformation in modern optimization
- Application of the dual active set algorithm to quadratic network optimization
- On the convergence of a multigrid method for Moreau-regularized variational inequalities of the second kind
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Iterative processes of Fejér type in ill-posed problems with a priori information
- On a decomposition formula for the resolvent operator of the sum of two set-valued maps with monotonicity assumptions
- Proximal method of solving split system of minimization problem
- A control-theoretic perspective on optimal high-order optimization
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- A sparse proximal implementation of the LP dual active set algorithm
- Self-adaptive inexact proximal point methods
- Weak and strong convergence theorems for common zeros of accretive operators
- On finite convergence of proximal point algorithms for variational inequalities
- New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks
- Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
- Derivative-free optimization via proximal point methods
- Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems
- Strongly relatively nonexpansive sequences generated by firmly nonexpansive-like mappings
- A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems
- On strongly quasiconvex functions: existence results and proximal point algorithms
- Modified Newton-type processes generating Fejér approximations of regularized solutions to nonlinear equations
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
- Monotone operator theory in convex optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the computation of equilibria in monotone and potential stochastic hierarchical games
- A new relative error criterion for the proximal point algorithm
- Convex programming algorithms using smoothing of exact penalty functions
- A unified and tight linear convergence analysis of the relaxed proximal point algorithm
- The geometry of monotone operator splitting methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications of optimal transportation. Abstracts from the workshop held February 4--9, 2024
- A general solution to the quasi linear screening problem
- A new boosted proximal point algorithm for minimizing nonsmooth DC functions
- Fejér-type iterative processes in the constrained quadratic minimization problem
- A two-step proximal point algorithm for nonconvex equilibrium problems with applications to fractional programming
- High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
- An inexact regularized proximal Newton method without line search
- An asynchronous subgradient-proximal method for solving additive convex optimization problems
- A semismooth Newton stochastic proximal point algorithm with variance reduction
- Tikhonov regularized iterative methods for nonlinear problems
- Principled analyses and design of first-order methods with inexact proximal operators
- High-dimensional Gaussian sampling: a review and a unifying approach based on a stochastic proximal point algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633161)
