Self-adaptive projection-based prediction-correction method for constrained variational inequalities
This paper deals with a class of monotone constrained variational inequalities with some linear constraints and on convex sets. The proofs combine the Lagrangian multipliers method with some projection type prediction-correction methods. The authors argue that the number of iterations is strongly dependent on a parameter that balances the primal and dual variables. Convergence of the proposed method is proved under mild conditions. In the last part of the present paper, some numerical experiments illustrate the effectiveness of the proposed methods.
- Self-adaptive prediction-correction method for constrained linear variational inequality problems
- An self-adaptive LQP method for constrained variational inequalities
- Solving linear variational inequality problems by a self-adaptive projection method
- A projection-based prediction-correction method for structured monotone variational inequalities
- A new self-adaptive projection method for variational inequalities
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
- Convergence of Proximal-Like Algorithms
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Inexact implicit methods for monotone general variational inequalities
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
- Monotone Operators and the Proximal Point Algorithm
- On Preconditioning of Incompressible Non-Newtonian Flow Problems
- Projected dynamical systems and variational inequalities with applications
- Quadratically constrained least squares and quadratic problems
- A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem
- An LQP-based two-step method for structured variational inequalities
- Prediction-correction alternating direction method for a class of constrained min-max problems
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints
- Self-adaptive predictor-corrector approach for general variational inequalities using a fixed-point formulation
- An self-adaptive LQP method for constrained variational inequalities
- Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints
- Self-adaptive prediction-correction method for constrained linear variational inequality problems
- A self-adaptive projection method for a class of variant variational inequalities
- Solving a class of variational inequality problems with a new inexact strategy
- Splitting augmented Lagrangian-type algorithms with partial quadratic approximation to solve sparse signal recovery problems
- A trust-region-based splitting method for optimization problems with linear constraints
This page was built for publication: Self-adaptive projection-based prediction-correction method for constrained variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266827)
