A relaxed projection method for variational inequalities

From MaRDI portal

Revision as of 10:23, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3732440

Jump to:navigation, search

DOI10.1007/BF01589441zbMath0598.49024OpenAlexW2051948401MaRDI QIDQ3732440

Masao Fukushima

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01589441

zbMATH Keywords

algorithm projection methods Convergence criteria

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Numerical methods of relaxation type (49M20)

Related Items (only showing first 100 items - show all)

A modified augmented Lagrangian method for a class of monotone variational inequalities ⋮ Gradient projection method with a new step size for the split feasibility problem ⋮ A smoothing inexact Newton method for variational inequalities with nonlinear constraints ⋮ A nonsmooth Newton method for variational inequalities. I: Theory ⋮ A globally convergent Newton method for solving strongly monotone variational inequalities ⋮ An explicit algorithm for monotone variational inequalities ⋮ Some improved convergence results for variational inequality problems ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces ⋮ Coupled variational inequalities: existence, stability and optimal control ⋮ The combination projection method for solving convex feasibility problems ⋮ A new convergence theorem of a projection algorithm with variable steps for variational inequalities ⋮ Iterative algorithms for variational inequalities governed by boundedly Lipschitzian and strongly monotone operators ⋮ A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces ⋮ An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ A relaxed projection method using a new linesearch for the split feasibility problem ⋮ Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem ⋮ Note on the modified relaxation CQ algorithm for the split feasibility problem ⋮ Outer perturbations of a projection method and two approximation methods for the split equality problem ⋮ Totally relaxed, self-adaptive algorithm for solving variational inequalities over the intersection of sub-level sets ⋮ Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces ⋮ Solving unbounded box constrained variational inequalities via a homotopy method ⋮ Inertial accelerated algorithms for solving a split feasibility problem ⋮ Regularized method for solving variational inequalities with a monotone operator on a polyhedron ⋮ Solving the variational inequality problem defined on intersection of finite level sets ⋮ Preconditioning methods for solving a general split feasibility problem ⋮ A combined relaxation method for variational inequalities with nonlinear constraints ⋮ A differentiable path-following algorithm for computing perfect stationary points ⋮ Polyak's gradient method for split feasibility problem constrained by level sets ⋮ Modified basic projection methods for a class of equilibrium problems ⋮ On descent-projection method for solving the split feasibility problems ⋮ Two-stage stochastic variational inequalities: an ERM-solution procedure ⋮ Finite termination of a Newton-type algorithm for a class of affine variational inequality problems ⋮ Strong convergence of a relaxed CQ algorithm for the split feasibility problem ⋮ A direct splitting method for nonsmooth variational inequalities ⋮ A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem ⋮ On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ Iterative methods for solving variational inequalities in Euclidean space ⋮ The relaxed inexact projection methods for the split feasibility problem ⋮ Outer approximation methods for solving variational inequalities in Hilbert space ⋮ Applications of fixed-point and optimization methods to the multiple-set split feasibility problem ⋮ Several acceleration schemes for solving the multiple-sets split feasibility problem ⋮ Modified halfspace-relaxation projection methods for solving the split feasibility problem ⋮ Unnamed Item ⋮ A combined method for smooth equilibrium problems with nonlinear constraints ⋮ A smoothing homotopy method for variational inequality problems on polyhedral convex sets ⋮ A two-phase algorithm for a variational inequality formulation of equilibrium problems ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Selective projection methods for solving a class of variational inequalities ⋮ Local linear convergence of an outer approximation projection method for variational inequalities ⋮ A hybrid subgradient algorithm for nonexpansive mappings and equilibrium problems ⋮ Decomposition method for a class of monotone variational inequality problems ⋮ Improving the solution of variational inequalities based on the optimization approach ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ A smoothing inexact Newton method for variational inequality problems ⋮ Full convergence of an approximate projection method for nonsmooth variational inequalities ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ Convergence theorems for the variational inequality problems and split feasibility problems in Hilbert spaces ⋮ Two-step methods and relaxed two-step methods for solving the split equality problem ⋮ Unnamed Item ⋮ A new halfspace-relaxation projection method for the split feasibility problem ⋮ A relaxed projection method for solving multiobjective optimization problems ⋮ Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces ⋮ Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem ⋮ A modified subgradient extragradient method for solving monotone variational inequalities ⋮ Homotopy method for solving variational inequalities with bounded box constraints ⋮ Strong convergence of a self-adaptive method for the split feasibility problem ⋮ On variable-step relaxed projection algorithm for variational inequalities ⋮ A note on Solodov and Tseng's methods for maximal monotone mappings ⋮ Convergence of direct methods for paramonotone variational inequalities ⋮ General splitting methods with linearization for the split feasibility problem ⋮ Solving variational inequalities by a modified projection method with an effective step-size ⋮ ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem ⋮ A smoothing homotopy method for solving variational inequalities ⋮ Alternating conditional gradient method for convex feasibility problems ⋮ Solving the split equality problem without prior knowledge of operator norms ⋮ New inertial relaxed method for solving split feasibilities ⋮ Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators ⋮ Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces ⋮ Self-adaptive iterative method for solving boundedly Lipschitz continuous and strongly monotone variational inequalities ⋮ An existence-uniqueness theorem and alternating contraction projection methods for inverse variational inequalities ⋮ Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems ⋮ An inertial extrapolation method for multiple-set split feasibility problem ⋮ Relaxed projection and contraction methods for solving Lipschitz continuous monotone variational inequalities ⋮ A forward-backward-forward algorithm for solving quasimonotone variational inequalities ⋮ The quasi-Newton method of solution of convex variational inequalities with descent decomposition ⋮ The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem ⋮ A multi-scale method for distributed convex optimization with constraints ⋮ Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem ⋮ A relaxed projection method for finite-dimensional equilibrium problems ⋮ A continuation method for (strongly) monotone variational inequalities ⋮ The strong convergence of Douglas-Rachford methods for the split feasibility problem ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets ⋮ Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities ⋮ A hybrid method for solving variational inequality problems ⋮ A general descent framework for the monotone variational inequality problem ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications ⋮ Strong convergence theorem of two-step iterative algorithm for split feasibility problems ⋮ A simple algorithm for computing projection onto intersection of finite level sets

Cites Work

This page was built for publication: A relaxed projection method for variational inequalities

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3732440&oldid=17246609"