scientific article; zbMATH DE number 1329059
From MaRDI portal
Publication:4257419
Recommendations
Cited in
(30)- New constrained optimization reformulation of complementarity problems
- Properties of restricted NCP functions for nonlinear complementarity 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 neural network for the linear complementarity problem
- Neural network models and its application for solving linear and quadratic programming problems
- An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
- Discretization of semilinear bang-singular-bang control problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- A special complementarity function revisited
- scientific article; zbMATH DE number 779149 (Why is no real title available?)
- A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
- scientific article; zbMATH DE number 7416500 (Why is no real title available?)
- Mean value theorems for the scalar derivative and applications
- Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
- Solving nonlinear complementarity problems with neural networks: A reformulation method approach
- LCQPow: a solver for linear complementarity quadratic programs
- The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems
- Computation of generalized differentials in nonlinear complementarity problems
- 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
- A self-adaptive trust region method for the extended linear complementarity problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4257419)
