Monotone Operators and the Proximal Point Algorithm
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A new iterative algorithm for common solutions of a finite family of accretive operators
- A generalized proximal point algorithm and implicit iterative schemes for a sequence of operators on Banach spaces
- Strong convergence theorems for monotone mappings and relatively weak nonexpansive mappings
- Common solutions of an iterative scheme for variational inclusions, equilibrium problems, and fixed point problems
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- A regularization smoothing Newton method for solving nonlinear complementarity problem
- Extra-proximal methods for solving two-person nonzero-sum games
- An algorithm for generalized variational inequality with pseudomonotone mapping
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- Equivalent theorems of the convergence between proximal type algorithms
- Strong convergence of projection scheme for zeros of maximal monotone operators
- A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems
- An inexact proximal point method for solving generalized fractional programs
- On the choice of explicit stabilizing terms in column generation
- On Rockafellar's theorem using proximal point algorithm involving H-maximal monotonicity framework
- A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping
- Perturbation techniques for nonexpansive mappings with applications
- Competitive facility location on decentralized supply chains
- Proximal-point algorithm using a linear proximal term
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- A new hybrid iterative method for solution of equilibrium problems and fixed point problems for an inverse strongly monotone operator and a nonexpansive mapping
- An extension of Luque's growth condition
- Viscosity approximations by generalized contractions for resolvents of accretive operators in Banach spaces
- Metric subregularity and the proximal point method
- Strong and weak convergence of modified Mann iteration for new resolvents of maximal monotone operators in Banach spaces
- Strong convergence of monotone hybrid method for maximal monotone operators and hemirelatively nonexpansive mappings
- A general iterative method for variational inequality problems, mixed equilibrium problems, and fixed point problems of strictly pseudocontractive mappings in Hilbert spaces
- A viscosity approximation method for finding common solutions of variational inclusions, equilibrium problems, and fixed point problems in Hilbert spaces
- An extragradient method and proximal point algorithm for inverse strongly monotone operators and maximal monotone operators in Banach spaces
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
- Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
- Proximal point algorithms for general variational inequalities
- Hybrid proximal-point methods for common solutions of equilibrium problems and zeros of maximal monotone operators
- A hybrid approximation method for equilibrium and fixed point problems for a family of infinitely nonexpansive mappings and a monotone mapping
- A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mappings
- Strong convergence of the iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems of an infinite family of nonexpansive mappings
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Role of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with Applications
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
- General proximal point algorithm involving -maximal accretiveness framework in Banach spaces
- A proximal approach to the inversion of ill-conditioned matrices
- Fixed point iterations coupled with relaxation factors and inertial effects
- Strong convergence of viscosity approximation methods for finding zeros of accretive operators in Banach spaces
- A primal-dual projection method for solving systems of linear inequalities
- Penalty-proximal methods in convex programming
- Régularization S.C.I. et -convergence: Approximations inf- convolutives associées à un référentiel. (L.S.C. regularization and -convergence: Inf-convolutive approximation associated with a reference functional)
- Well behaved asymptotical convex functions
- An intrinsic characterization of foldings of Euclidean space
- Implementing proximal point methods for linear programming
- Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- On the asymptotic behavior of nonlinear semigroups and the range of accretive operators
- Convergence of iterative processes in nonlinear optimization
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Finite termination of the proximal point algorithm
- Decomposition algorithm for convex differentiable minimization
- Extended scenario analysis
- Penalization in non-classical convex programming via variational convergence
- Ball algorithms for constructing solutions of nonlinear operator equations
- Dual convergence theorems for the infinite products of resolvents in Banach spaces
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Modified proximal point algorithm for extended linear-quadratic programming
- Produits infinis de resolvantes
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Variational metric and exponential penalization
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Progressive regularization of variational inequalities and decomposition algorithms
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- Proximal methods in view of interior-point strategies
- Prox-regularization and solution of ill-posed elliptic variational inequalities
- Approximate iterations in Bregman-function-based proximal algorithms
- Approximation theory for stochastic variational and Ky Fan inequalities in finite dimensions
- Dual active sets and constrained optimization
- Error bounds and convergence analysis of feasible descent methods: A general approach
- The perturbed proximal point algorithm and some of its applications
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- Proximal minimization algorithm with \(D\)-functions
- Interior proximal point algorithm for linear programs
- Augmented Lagrangian algorithms for linear programming
- Data parallel computing for network-structured optimization problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Interior dual proximal point algorithm for linear programs
- Duality results and proximal solutions of the Huber M-estimator problem
- A nonsmooth Newton method for variational inequalities. I: Theory
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Finite master programs in regularized stochastic decomposition
- Variable metric bundle methods: From conceptual to implementable forms
- A trust region method for minimization of nonsmooth functions with linear constraints
- On piecewise quadratic Newton and trust region problems
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- Nonlinear rescaling and proximal-like methods in convex optimization
- Conditioning and regularization of nonsymmetric operators
- Decomposition methods in stochastic programming
- A class of combined iterative methods for solving variational inequalities
- A proximal point algorithm for minimax problems
- Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems
- Equilibrium programming using proximal-like algorithms
This page was built for publication: Monotone Operators and the Proximal Point Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132266)