Family of perturbation methods for variational inequalities
From MaRDI portal
Publication:1918010
DOI10.1007/BF02192537zbMath0848.49008MaRDI QIDQ1918010
Van Hien Nguyen, S. Makler-Scheimberg, Jean Jacques Strodiot
Publication date: 16 October 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
decomposition algorithmsiterative algorithmsauxiliary problem principlemonotone operatorsnonlinear variational inequalitiesnonlinear complementarityepiconvergence
Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Decomposition Methods Based on Augmented Lagrangians: A Survey, Extended auxiliary problem principle to variational inequalities involving multi-valued operators, A projection algorithm for general variational inequalities with perturbed constraint sets, A projected subgradient method for solving generalized mixed variational inequalities, Convergence of the approximate auxiliary problem method for solving generalized variational inequalities, Extended auxiliary problem principle using Bregman distances, Generalized vector quasi-variational inequality problems over product sets, A Redistributed Bundle Algorithm for Generalized Variational Inequality Problems in Hilbert Spaces, Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming, Bregman functions and auxiliary problem principle, An approximate bundle-type auxiliary problem method for solving generalized variational inequalities, Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities, A relaxed projection method for finite-dimensional equilibrium problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Auxiliary problem principle and decomposition of optimization problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Penalty-proximal methods in convex programming
- A note on a globally convergent Newton method for solving monotone variational inequalities
- Nested monotony for variational inequalities over product of spaces and convergence of iterative algorithms
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- A globally convergent Newton method for solving strongly monotone variational inequalities
- A Sequential Linear Programming Algorithm for Solving Monotone Variational Inequalities
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- Asymmetric variational inequality problems over product sets: Applications and iterative methods
- A Parallel Algorithm for a Class of Convex Programs
- Iterative methods for variational and complementarity problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Monotone Operators and the Proximal Point Algorithm
- Numerical methods for nondifferentiable convex optimization
- An iterative scheme for variational inequalities
- State Constraints in Convex Control Problems of Bolza
- Complementarity problems
