A new strategy for solving variational inequalities in bounded polytopes∗

DOI10.1080/01630569508816637MaRDI QIDQ4845182zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmnumerical experimentsoptimality conditionsglobal minimizersstationary pointsvariational inequality problemsbox constrained minimization problembounded polytope

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3716008 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• A new trust region algorithm for bound constrained minimization
• A special newton-type optimization method
• A variational inequality approach for the determination of oligopolistic market equilibrium
• An iterative scheme for variational inequalities
• Iterative methods for variational and complementarity problems
• On the Resolution of Linearly Constrained Convex Minimization Problems
• The nonlinear complementarity problem with applications. II

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
• On the natural merit function for solving complementarity problems
• A result on vector variational inequalities with polyhedral constraint sets
• 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^∗
• Perturbed solutions of variational inequality problems over polyhedral sets
• A unifying geometric solution framework and complexity analysis for variational inequalities
• 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)