A new strategy for solving variational inequalities in bounded polytopes∗
DOI10.1080/01630569508816637zbMATH Open0824.49026OpenAlexW2022921601MaRDI QIDQ4845182FDOQ4845182
Authors: A. Friedlander, J. M. Martínez, S. A. Santos 
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
Recommendations
- An interior-point-type iterative method for variational inequality problems
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
- scientific article; zbMATH DE number 5720488
- An algorithm to solve variational inequalities in the linear case
- A new LQP method for solving variational inequality problems on polyhedra
algorithmnumerical experimentsoptimality conditionsglobal minimizersstationary pointsvariational inequality problemsbox constrained minimization problembounded polytope
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40) Newton-type methods (49M15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An iterative scheme for variational inequalities
- Iterative methods for variational and complementarity problems
- A special newton-type optimization method
- A variational inequality approach for the determination of oligopolistic market equilibrium
- The nonlinear complementarity problem with applications. II
- A new trust region algorithm for bound constrained minimization
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- On the Resolution of Linearly Constrained Convex Minimization Problems
Cited In (16)
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
- Homotopy method for solving variational inequalities with bounded box constraints
- 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 Jacobian smoothing method for box constrained variational inequality problems
- The reformulation of nonlinear complementarity problems using the Fischer-Burmeister function
- A result on vector variational inequalities with polyhedral constraint sets
- On the natural merit function for solving complementarity problems
- A smoothing Broyden-like method for the mixed complementarity problems
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- A unifying geometric solution framework and complexity analysis for variational inequalities
- Perturbed solutions of variational inequality problems over polyhedral sets
- A positive interior-point algorithm for nonlinear complementarity problems.
- On the regularization of mixed complementarity problems
- On the solution of bounded and unbounded mixed complementarity problems
This page was built for publication: A new strategy for solving variational inequalities in bounded polytopes∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845182)
