A globally convergent BFGS method for pseudo-monotone variational inequality problems
DOI10.1080/10556788.2017.1332619zbMATH Open1406.49008OpenAlexW2626553673MaRDI QIDQ4646672FDOQ4646672
Authors: Fatemeh Abdi, Fatemeh Shakeri 
Publication date: 14 January 2019
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1332619
Recommendations
- A class of globally convergent algorithms for pseudomonotone variational inequalities
- Global method for monotone variational inequality problems with inequality constraints
- Modified self-adaptive projection method for solving pseudomonotone variational inequalities
- An LQP method for pseudomonotone variational inequalities
- scientific article; zbMATH DE number 7267087
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40) Newton-type methods (49M15)
Cites Work
- Network economics: a variational inequality approach
- Title not available (Why is that?)
- Strongly Regular Generalized Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Minimization of functions having Lipschitz continuous first partial derivatives
- A New Projection Method for Variational Inequality Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Iterative methods for variational and complementarity problems
- Strong Stability in Variational Inequalities
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Title not available (Why is that?)
- Feasible descent algorithms for mixed complementarity problems
- Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- A new version of extragradient method for variational inequality problems
- A globally convergent Newton method for solving strongly monotone variational inequalities
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- A hybrid Newton method for solving the variational inequality problem via the D-gap function
- A hybrid Josephy — Newton method for solving box constrained variational equality roblems via the D-gap function
- Title not available (Why is that?)
- A note on a globally convergent Newton method for solving monotone variational inequalities
- OPTIMIZATION BASED GLOBALLY CONVERGENT METHODS FOR THE NONLINEAR COMPLEMENTARITY PROBLEM
- Title not available (Why is that?)
- A NOTE ON GLOBALLY CONVERGENT NEWTON METHOD FOR STRONGLY MONOTONE VARIATIONAL INEQUALITIES
- Linear Stability of Generalized Equations Part I: Basic Theory
- Linear Stability of Generalized Equations, Part II: Applications to Nonlinear Programming
Cited In (2)
This page was built for publication: A globally convergent BFGS method for pseudo-monotone variational inequality problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646672)
