Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
From MaRDI portal
Publication:5042653
Recommendations
- An inexact algorithm with proximal distances for variational inequalities
- scientific article; zbMATH DE number 2109090
- Inexact proximal point methods for variational inequality problems
- An inexact interior point proximal method for the variational inequality problem
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
Cites work
- A generalized proximal-point-based prediction-correction method for variational inequality problems
- A new Bregman projection method for solving variational inequalities in Hilbert spaces
- A proximal multiplier method for separable convex minimization
- A proximal point algorithm with asymmetric linear term
- An alternate minimization method beyond positive definite proximal regularization: convergence and complexity
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- An implementable proximal point algorithmic framework for nuclear norm minimization
- An inexact algorithm with proximal distances for variational inequalities
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- An inexact proximal method for quasiconvex minimization
- An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds
- An interior proximal method for a class of quasimonotone variational inequalities
- Approximate iterations in Bregman-function-based proximal algorithms
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of Proximal-Like Algorithms
- Convergence rate analysis of iteractive algorithms for solving variational inequality problems
- Convergence rate of a proximal multiplier algorithm for separable convex minimization
- Double-regularization proximal methods, with complementarity applications
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Interior projection-like methods for monotone variational inequalities
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Interior proximal methods for quasiconvex optimization
- Modified extragradient method with Bregman distance for variational inequalities
- Monotone Operators and the Proximal Point Algorithm
- Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets
- On linear convergence of iterative methods for the variational inequality problem
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Proximal Minimization Methods with Generalized Bregman Functions
- Pseudomonotone operators and the Bregman proximal point algorithm
- Variational Analysis
Cited in
(10)- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- An algorithmic approach to prox-regular variational inequalities
- Inexact proximal point methods for variational inequality problems
- An inexact algorithm with proximal distances for variational inequalities
- scientific article; zbMATH DE number 2109090 (Why is no real title available?)
- A new inexactness criterion for approximate logarithmic-quadratic proximal methods
- An approximate proximal extragradient algorithm for general monotone variational inequalities
- New outer proximal methods for solving variational inequality problems
- A search-free \(O(1/k^{3/2})\) homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities
- A proximal algorithm for constrained multiobjective minimization with quasiconvex functions
This page was built for publication: Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042653)
