On the resolution of monotone complementarity problems
type: Item
instance of: scholarly article
title: On the resolution of monotone complementarity problems
zbMATH Open document ID: 0859.90113
DOI: 10.1007/BF00249054
author: Carl Geiger
author: Christian Kanzow
published in: Computational Optimization and Applications
publication date: 1996-11-03T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 941330
zbMATH Keywords: stationary points
zbMATH Keywords: global minima
zbMATH Keywords: nonlinear complementarity
zbMATH Keywords: unconstrained minimization
zbMATH Keywords: descent algorithm
describes a project that uses: L-BFGS
describes a project that uses: MCPLIB
MaRDI profile type: Publication
cites work: Q4003375
cites work: A special newton-type optimization method
cites work: A Newton-type method for positive-semidefinite linear complementarity problems
cites work: Q4226179
cites work: Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
cites work: Some numerical experiments with variable-storage quasi-Newton algorithms
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
cites work: Test examples for nonlinear programming codes
cites work: Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
cites work: Nonlinear complementarity as unconstrained optimization
cites work: An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
cites work: On the limited memory BFGS method for large scale optimization
cites work: New Error Bounds for the Linear Complementarity Problem
cites work: Equivalence of the Complementarity Problem to a System of Nonlinear Equations
cites work: Nonlinear complementarity as unconstrained and constrained minimization
cites work: Q4039868
cites work: A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Newton's Method for B-Differentiable Equations
cites work: A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
cites work: NE/SQP: A robust algorithm for the nonlinear complementarity problem
cites work: A globally convergent Newton method for solving strongly monotone variational inequalities
cites work: Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
cites work: Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
cites work: Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
cites work: On stationary points of the implicit Lagrangian for nonlinear complementarity problems
cites work: Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods
full work available at URL: https://doi.org/10.1007/bf00249054
OpenAlex ID: W2140603012
description: scientific article; zbMATH DE number 941330