A new accuracy criterion for approximate proximal point algorithms
From MaRDI portal
Publication:5955039
DOI10.1006/jmaa.2001.7535zbMath0995.65062OpenAlexW1976468304MaRDI QIDQ5955039
Publication date: 7 February 2002
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.2001.7535
Related Items
Convergence of over-relaxed contraction-proximal point algorithm in Hilbert spaces ⋮ On weak and strong convergence results for generalized equilibrium variational inclusion problems in Hilbert spaces ⋮ Error sensitivity for strongly convergent modifications of the proximal point algorithm ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Some proximal algorithms for linearly constrained general variational inequalities ⋮ Regularization of proximal point algorithms in Hadamard manifolds ⋮ On two iterative methods for mixed monotone variational inequalities ⋮ Inexact proximal point method for general variational inequalities ⋮ The prediction-correction approach to nonlinear complementarity problems ⋮ The developments of proximal point algorithms ⋮ On relaxed and contraction-proximal point algorithms in Hilbert spaces ⋮ Approximating zeros of monotone operators by proximal point algorithms ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods ⋮ A new predicto-corrector method for pseudomonotone nonlinear complementarity problems ⋮ Modified proximal-point method for nonlinear complementarity problems ⋮ An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds ⋮ On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators ⋮ On convergence criteria of generalized proximal point algorithms ⋮ Inexact operator splitting methods with selfadaptive strategy for variational inequality problems ⋮ An inexact proximal-type algorithm in Banach spaces ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ An operator splitting method for monotone variational inequalities with a new perturbation strategy ⋮ The contraction-proximal point algorithm with square-summable errors ⋮ A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ A relaxed approximate proximal point algorithm ⋮ Modified approximate proximal point algorithms for finding roots of maximal monotone operators ⋮ Rate of convergence for proximal point algorithms on Hadamard manifolds ⋮ Solving a class of variational inequalities with inexact oracle operators ⋮ A new logarithmic-quadratic proximal method for nonlinear complementarity problems ⋮ Metastability of the proximal point algorithm with multi-parameters ⋮ Solving a Class of Variational Inequality Problems with a New Inexact Strategy ⋮ A proximal point algorithm with asymmetric linear term ⋮ Proximal point algorithms for general variational inequalities ⋮ A generalized contraction proximal point algorithm with two monotone operators ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ Unnamed Item ⋮ The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities
Cites Work
- Auxiliary problem principle and decomposition of optimization problems
- Auxiliary problem principle extended to variational inequalities
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Approximate iterations in Bregman-function-based proximal algorithms
- Proximal minimization algorithm with \(D\)-functions
- A proximal-based deomposition method for compositions method for convex minimization problems
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Nonlinear proximal decomposition method for convex programming
- Inexact implicit methods for monotone general variational inequalities
- Multiplier and gradient methods
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
- Inexact Newton Methods
- Monotone Operators and the Proximal Point Algorithm
- Note on the topological degree of the subdifferential of a lower semi-continuous convex function
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Inexact Newton methods for the nonlinear complementarity problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
