scientific article; zbMATH DE number 1329059
From MaRDI portal
Publication:4257419
zbMath0948.90133MaRDI QIDQ4257419
Publication date: 31 August 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karush-Kuhn-Tucker conditionsnonlinear complementarity problemsNewton-type methodlinear completementarity problems
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Discretization of semilinear bang-singular-bang control problems ⋮ Neural network models and its application for solving linear and quadratic programming problems ⋮ Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems ⋮ A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems ⋮ Solution of monotone complementarity problems with locally Lipschitzian functions ⋮ On unconstrained and constrained stationary points of the implicit Lagrangian ⋮ Error bounds in mathematical programming ⋮ Stationary points of bound constrained minimization reformulations of complementarity problems ⋮ New NCP-functions and their properties ⋮ Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds ⋮ A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods ⋮ A special complementarity function revisited ⋮ Recurrent neural network model based on projective operator and its application to optimization problems ⋮ On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability ⋮ Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities ⋮ An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems ⋮ The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems ⋮ Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem ⋮ Solving nonlinear complementarity problems with neural networks: A reformulation method approach ⋮ Mean Value Theorems for the Scalar Derivative and Applications ⋮ A self-adaptive trust region method for the extended linear complementarity problems ⋮ New constrained optimization reformulation of complementarity problems ⋮ Properties of restricted NCP functions for nonlinear complementarity problems ⋮ Computation of generalized differentials in nonlinear complementarity problems ⋮ Equivalence of the generalized complementarity problem to differentiable unconstrained minimization ⋮ Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function ⋮ A neural network for the linear complementarity problem
