Approximate subgradient extragradient methods for solving variational inequality problems: Convergence analysis and applications in signal and image processing

This paper introduces two new inertial algorithms for solving variational inequality problems in a real Hilbert space. The first algorithm integrates an acceleration scheme into a two-step subgradient extragradient framework, guaranteeing weak convergence under monotonicity and achieving R -linear convergence when the operator is strongly monotone. The second algorithm modifies this structure to ensure strong convergence of the generated sequence. Both methods employ adaptive step size strategies, which eliminate the need for estimating the Lipschitz constant or performing line search procedures. The effectiveness of the proposed algorithms is validated through numerical experiments, which demonstrate their competitive performance relative to existing methods. Their practical applicability is further illustrated through applications in signal recovery and image restoration, where they outperform several well-known algorithms from the literature.

Authors

Institutions

Publication Details

Journal
Communications in Nonlinear Science and Numerical Simulation
Published
2025-08-12
DOI
https://doi.org/10.1016/j.cnsns.2025.109211
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Approximate subgradient extragradient methods for solving variational inequality problems: Convergence analysis and applications in signal and image processing

Jen‐Chih Yao, Habib ur Rehman, Zai-Yun Peng
Communications in Nonlinear Science and Numerical Simulation
Optimization and Variational Analysis
article

Approximate subgradient extragradient methods for solving variational inequality problems: Convergence analysis and applications in signal and image processing

Jen‐Chih Yao, Habib ur Rehman, Zai-Yun Peng
article en

Abstract

This paper introduces two new inertial algorithms for solving variational inequality problems in a real Hilbert space. The first algorithm integrates an acceleration scheme into a two-step subgradient extragradient framework, guaranteeing weak convergence under monotonicity and achieving R -linear convergence when the operator is strongly monotone. The second algorithm modifies this structure to ensure strong convergence of the generated sequence. Both methods employ adaptive step size strategies, which eliminate the need for estimating the Lipschitz constant or performing line search procedures. The effectiveness of the proposed algorithms is validated through numerical experiments, which demonstrate their competitive performance relative to existing methods. Their practical applicability is further illustrated through applications in signal recovery and image restoration, where they outperform several well-known algorithms from the literature.

Communications in Nonlinear Science and Numerical SimulationVol. 152
Yunnan Normal University (CN), Zhejiang Normal University (CN), China Medical University (TW), Academia Oamenilor de Știință din România (RO), Chongqing Jiaotong University (CN)
Reduced inequalities
Openalex Percentile: Top 78%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.