A new strategy for solving variational inequalities in bounded polytopes∗
DOI10.1080/01630569508816637zbMath0824.49026OpenAlexW2022921601MaRDI QIDQ4845182
Ana Friedlander, Sandra Augusta Santos, José Mario Martínez
Publication date: 13 November 1995
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569508816637
algorithmnumerical experimentsoptimality conditionsglobal minimizersstationary pointsvariational inequality problemsbox constrained minimization problembounded polytope
Numerical mathematical programming methods (65K05) Variational inequalities (49J40) Newton-type methods (49M15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A new trust region algorithm for bound constrained minimization
- The nonlinear complementarity problem with applications. II
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Iterative methods for variational and complementarity problems
- On the Resolution of Linearly Constrained Convex Minimization Problems
- A special newton-type optimization method
- An iterative scheme for variational inequalities
- A variational inequality approach for the determination of oligopolistic market equilibrium