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

zbMATH Keywords

algorithmnumerical experimentsoptimality conditionsglobal minimizersstationary pointsvariational inequality problemsbox constrained minimization problembounded polytope

Mathematics Subject Classification ID

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 (12)

On the regularization of mixed complementarity problems ⋮ Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds ⋮ A positive interior-point algorithm for nonlinear complementarity problems. ⋮ On the natural merit function for solving complementarity problems ⋮ Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗ ⋮ Homotopy method for solving variational inequalities with bounded box constraints ⋮ On the solution of bounded and unbounded mixed complementarity problems ⋮ A Jacobian smoothing method for box constrained variational inequality problems ⋮ The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems ⋮ A smoothing homotopy method for solving variational inequalities ⋮ On the solution of the extended linear complementarity problem ⋮ A smoothing Broyden-like method for the mixed complementarity problems

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new strategy for solving variational inequalities in bounded polytopes^∗