A continuation method for monotone variational inequalities

Mathematical Programming

Volumn 69, Issue 1-3, 1995, Pages 237-253

  Chen, Bintong ^a   Harker, Patrick T ^b  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Continuation method; Nonlinear complementarity; Nonlinear programming; Variational inequality

Indexed keywords

EID: 0001067548     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01585559     Document Type: Article

References (29)

1. Numerical methods for nondifferentiable convex optimization
2. Penalty-proximal methods in convex programming
3. A non-interior-point continuation method for linear complementarity problems
4. A non-interior-point continuation method for quadratic and linear programs
5. An outer approximation algorithm for solving general convex program
6. Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
7. Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications
8. On convex programming with internal regularization
9. A new continuation method for complementarity problems with uniform P-functions
10. Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems
11. Homotopy continuation methods for complementarity problems
12. A polynomial-time algorithm for a class of linear complementarity problems
13. Sensitivity analysis for nonlinear programs and variational inequalities with nonunique multipliers
14. Equivalence of the complementarity problem to a system of nonlinear equations
15. Iterative solution of linear programs
16. Régularization d'inéquations variationnelles par approximation successives
17. The complementarity problem for maximal monotone multifunctions
18. Stable monotone variational inequalities
19. A posteriori error bounds for linearly constrained variational inequality problems
20. NE/SQP: A robust algorithm for the nonlinear complementarity problem
21. Augmented Lagrangian and application of the proximal point algorithm in convex programming
22. Monotone operators and the proximal point algorithm
23. Solving the nonlinear complementarity problem by a homotopy method