An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
From MaRDI portal
Publication:1290609
DOI10.1007/BF01580089zbMath0919.90123OpenAlexW2150867680MaRDI QIDQ1290609
Stavros A. Zenios, Yair Censor, Alfredo Noel Iusem
Publication date: 5 September 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580089
variational inequalitymonotone operatorinterior point methodBregman functionsgeneralized distancesparamonotone operators
Related Items
Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ Interior proximal extragradient method for equilibrium problems ⋮ A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities ⋮ An interior point method for the nonlinear complementarity problem ⋮ A relaxed extragradient-like method for a generalized mixed equilibrium problem, a general system of generalized equilibria and a fixed point problem ⋮ Convergence of hybrid steepest-descent methods for variational inequalities ⋮ Generalized Bregman projections in convex feasibility problems ⋮ Iterative algorithms for a general system of generalized nonlinear mixed composite-type equilibria ⋮ Interior point methods for equilibrium problems ⋮ On some properties of generalized proximal point methods for variational inequalities ⋮ Unnamed Item ⋮ Iterative methods for hierarchical common fixed point problems and variational inequalities ⋮ An interior proximal method for a class of quasimonotone variational inequalities ⋮ Iterative algorithms for hierarchical fixed points problems and variational inequalities ⋮ Finding common solutions of a variational inequality, a general system of variational inequalities, and a fixed-point problem via a hybrid extragradient method ⋮ Self-adaptive gradient projection algorithms for variational inequalities involving non-Lipschitz continuous operators ⋮ Modified Noor's extragradient method for solving generalized variational inequalities in Banach spaces ⋮ Bregman-Golden ratio algorithms for variational inequalities ⋮ An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant ⋮ Solving nonmonotone affine variational inequalities problem by DC programming and DCA ⋮ Interior proximal methods for quasiconvex optimization ⋮ Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Strong convergence of an iterative algorithm for variational inequalities in Banach spaces ⋮ Attouch-Théra duality revisited: Paramonotonicity and operator splitting ⋮ Hybrid extragradient-like methods for generalized mixed equilibrium problems, systems of generalized equilibrium problems and optimization problems ⋮ Pseudomonotone operators and the Bregman proximal point algorithm ⋮ An alternating extragradient method with non Euclidean projections for saddle point problems ⋮ Full convergence of an approximate projection method for nonsmooth variational inequalities ⋮ The Generalized Bregman Distance ⋮ Finite convergence of the proximal point algorithm for variational inequality problems ⋮ Interior proximal method without the cutting plane property ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ An inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities ⋮ A new relaxed extragradient-like algorithm for approaching common solutions of generalized mixed equilibrium problems, a more general system of variational inequalities and a fixed point problem ⋮ Hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems ⋮ Rectangularity and paramonotonicity of maximally monotone operators ⋮ On variable-step relaxed projection algorithm for variational inequalities ⋮ A new hybrid iterative algorithm for variational inequalities ⋮ Convergence of direct methods for paramonotone variational inequalities ⋮ Interior Proximal Methods for equilibrium programming: part II ⋮ Approach to common elements of variational inequality problems and fixed point problems via a relaxed extragradient method ⋮ A proximal point method in nonreflexive Banach spaces ⋮ Pseudomonotone\(_*\) maps and the cutting plane property ⋮ A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems ⋮ Bregman-like functions and proximal methods for variational problems with nonlinear constraints ⋮ Double-regularization proximal methods, with complementarity applications ⋮ Decentralized hierarchical constrained convex optimization ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ On convergence of the proximal point algorithm in Banach spaces ⋮ A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant ⋮ Approximate iterations in Bregman-function-based proximal algorithms ⋮ Regularization by Denoising via Fixed-Point Projection (RED-PRO)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The primal-dual algorithm as a constraint-set-manipulation device
- A relaxed version of Bregman's method for convex programming
- An iterative row-action method for interval convex programming
- Proximal minimization algorithm with \(D\)-functions
- An iterative algorithm for the variational inequality problem
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Full convergence of the steepest descent method with inexact line searches
- A proximal regularization of the steepest descent method
- Convex Analysis
