A Greedy Fixed-Point Method for Solving Variational Inequalities over the Fixed-Point Constraints

DOI10.1080/01630563.2025.2472620MaRDI QIDQ7002806zbMATH OpenFDO

Authors Mootta Prangprakhon, Jedsadapong Pio-on, Nimit Nimana, Yeol Je Cho

Publication date 3 April 2025

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630563.2025.2472620

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical optimization and variational techniques (65K10) Numerical methods for variational inequalities and related problems (65K15)

Cites work

• A first order method for solving convex bilevel optimization problems
• A sequential constraint method for solving variational inequality over the intersection of fixed point sets
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• An ergodic algorithm for the power-control games for CDMA data networks
• Convex analysis and monotone operator theory in Hilbert spaces
• Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
• Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
• First-order methods in optimization
• General method for solving the split common fixed point problem
• scientific article; zbMATH DE number 3852340 (Why is no real title available?)
• scientific article; zbMATH DE number 3933858 (Why is no real title available?)
• scientific article; zbMATH DE number 1376935 (Why is no real title available?)
• scientific article; zbMATH DE number 3229228 (Why is no real title available?)
• scientific article; zbMATH DE number 3301853 (Why is no real title available?)
• Iterative Algorithms for Nonlinear Operators
• Iterative methods for fixed point problems in Hilbert spaces
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the unrestricted iteration of projections in Hilbert space
• Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
• Projection methods for variational inequalities with application to the traffic assignment problem
• Quasi-Fejérian analysis of some optimization algorithms
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Solving Systems of Linear Inequalities
• The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces
• The viscosity technique for the implicit midpoint rule of nonexpansive mappings in Hilbert spaces
• Variational Inequalities and Economic Equilibrium
• Viscosity approximation methods for fixed-points problems
• Viscosity approximation methods for nonexpansive mappings
• Weak convergence of the sequence of successive approximations for nonexpansive mappings

This page was built for publication: A Greedy Fixed-Point Method for Solving Variational Inequalities over the Fixed-Point Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7002806)