Interior projection-like methods for monotone variational inequalities

From MaRDI portal
Publication:2570999

DOI10.1007/s10107-004-0568-xzbMath1159.90517OpenAlexW2005369372MaRDI QIDQ2570999

Alfred Auslender, Marc Teboulle

Publication date: 31 October 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0568-x



Related Items

An additional projection step to He and Liao's method for solving variational inequalities, The interior proximal extragradient method for solving equilibrium problems, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, Modified descent-projection method for solving variational inequalities, A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming, A simplified view of first order methods for optimization, MODIFIED PROJECTION METHOD FOR GENERAL VARIATIONAL INEQUALITIES, SOME NEW RESOLVENT METHODS FOR SOLVING GENERAL MIXED VARIATIONAL INEQUALITIES, ON A NEW NUMERICAL METHOD FOR SOLVING GENERAL VARIATIONAL INEQUALITIES, THREE-STEP PROJECTION METHOD FOR GENERAL VARIATIONAL INEQUALITIES, Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle, Approximation accuracy, gradient methods, and error bound for structured convex optimization, A new method for solving monotone generalized variational inequalities, Accelerated schemes for a class of variational inequalities, Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation, Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems, No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization, Convergence rate of a proximal multiplier algorithm for separable convex minimization, Explicit hierarchical fixed point approach to variational inequalities, Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space, Unnamed Item, Characterizing the nonemptiness and compactness of the solution set of a vector variational inequality by scalarization, An alternating extragradient method with non Euclidean projections for saddle point problems, A cyclic block coordinate descent method with generalized gradient projections, Unnamed Item, On the optimal linear convergence rate of a generalized proximal point algorithm, A version of the mirror descent method to solve variational inequalities, Nonmonotone projected gradient methods based on barrier and Euclidean distances, Characterizations of asymptotic cone of the solution set of a composite convex optimization problem, Weighted variational inequalities in non-pivot Hilbert spaces with applications, Korpelevich's method for variational inequality problems in Banach spaces, Modified self-adaptive projection method for solving pseudomonotone variational inequalities, Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis, Convergence of direct methods for paramonotone variational inequalities, Unnamed Item, New extragradient-type methods for solving variational inequalities, A proximal multiplier method for separable convex minimization, A simple algorithm for a class of nonsmooth convex-concave saddle-point problems, Primal-dual subgradient methods for convex problems, A new logarithmic-quadratic proximal method for nonlinear complementarity problems, The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming, On the convergence rate of Douglas-Rachford operator splitting method, Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities, Unnamed Item, An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization, An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels, Modified extragradient methods for solving variational inequalities, Convergence of two-stage method with Bregman divergence for solving variational inequalities, An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function, NEW THREE-STEP ITERATIVE METHOD FOR SOLVING MIXED VARIATIONAL INEQUALITIES, An interior projected-like subgradient method for mixed variational inequalities, On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators, A projection descent method for solving variational inequalities, A Strongly Convergent Combined Relaxation Method in Hilbert Spaces



Cites Work