An NE/SQP method for the bounded nonlinear complementarity problem

DOI10.1023/A:1022643104274zbMath0911.90322OpenAlexW2067448652MaRDI QIDQ1265015

K. Appert

Publication date: 20 April 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022643104274

zbMATH Keywords

sequential quadratic programmingnonlinear complementarity problemmathematical programming

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (5)

A power penalty method for a bounded nonlinear complementarity problem ⋮ The interpolating element-free Galerkin method for the \(p\)-Laplace double obstacle mixed complementarity problem ⋮ A penalty approximation method for a semilinear parabolic double obstacle problem ⋮ An interior penalty method for a large-scale finite-dimensional nonlinear double obstacle problem ⋮ A power penalty approach to a mixed quasilinear elliptic complementarity problem

Uses Software

• QPCOMP
• QPOPT

Cites Work

• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Test examples for nonlinear programming codes
• An inexact NE/SQP method for solving the nonlinear complementarity problem
• QPCOMP: A quadratic programming based solver for mixed complementarity problems
• A semismooth equation approach to the solution of nonlinear complementarity problems
• Nonsmooth Equations: Motivation and Algorithms
• A mathematical programming approach for determining oligopolistic market equilibrium
• Equilibria on a Congested Transportation Network

This page was built for publication: An NE/SQP method for the bounded nonlinear complementarity problem