On the resolution of monotone complementarity problems

Authors:
Carl Geiger;Christian Kanzow
Affiliations:
-;-
Venue:
Computational Optimization and Applications
Year:
1996

Citing 0
Cited 27

A Comparison of Large Scale Mixed Complementarity Problem Solvers

Computational Optimization and Applications
A Globally Convergent Sequential Quadratic Programming Algorithm for Mathematical Programs with Linear Complementarity Constraints

Computational Optimization and Applications
Some Optimization Reformulations of the Extended Linear Complementarity Problem

Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems

Computational Optimization and Applications
Hybrid Newton-type method for a class of semismooth equations

Journal of Optimization Theory and Applications
Global Optimization Techniques for Mixed Complementarity Problems

Journal of Global Optimization
A Linearly Convergent Derivative-Free Descent Method for Strongly Monotone Complementarity Problems

Computational Optimization and Applications
Merit Functions for Complementarity and Related Problems: A Survey

Computational Optimization and Applications
On Two Applications of H-Differentiability to Optimization and Complementarity Problems

Computational Optimization and Applications
Some new projection methods for variational inequalities

Applied Mathematics and Computation
Global Newton-type methods and semismooth reformulations for NCP

Applied Numerical Mathematics
An application of H-differentiability to nonnegative and unrestricted generalized complementarity problems

Computational Optimization and Applications
A descent method for a reformulation of the second-order cone complementarity problem

Journal of Computational and Applied Mathematics
Box-constrained minimization reformulations of complementarity problems in second-order cones

Journal of Global Optimization
The convergence of a one-step smoothing Newton method for P0-NCP based on a new smoothing NCP-function

Journal of Computational and Applied Mathematics
A family of NCP functions and a descent method for the nonlinear complementarity problem

Computational Optimization and Applications
A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for P0-NCPs

Journal of Computational and Applied Mathematics
An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function

Journal of Computational and Applied Mathematics
A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems

Information Sciences: an International Journal
A new smoothing and regularization Newton method for P0-NCP

Journal of Global Optimization
A new class of penalized NCP-functions and its properties

Computational Optimization and Applications
A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P0-function

Journal of Global Optimization
A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer---Burmeister merit function

Numerical Algorithms
A neural network for the linear complementarity problem

Mathematical and Computer Modelling: An International Journal
A new approach to continuation methods for complementarity problems with uniform P-functions

Operations Research Letters
Smoothing SQP algorithm for semismooth equations with box constraints

Computational Optimization and Applications
Neural network for solving convex quadratic bilevel programming problems

Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract