A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone
DOI10.1007/S00245-005-0823-4zbMATH Open1087.65064OpenAlexW2080436273MaRDI QIDQ814939FDOQ814939
Authors: Fengming Ma, Yiju Wang, Jianzhong Zhang
Publication date: 8 February 2006
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00245-005-0823-4
Recommendations
- Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem
- A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
- A smoothing Newton-type method for generalized nonlinear complementarity problem
- A smoothing Levenberg-Marquardt method for NCP
- A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem
numerical examplesnonlinear complementarity problemsuperlinear convergenceLevenberg-Marquardt algorithm
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (22)
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- An improvement of global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
- An improvement on the global error bound estimation for ELCP and its applications
- Generalized polynomial complementarity problems over a polyhedral cone
- Quadratic optimization over a polyhedral cone
- A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
- A complementarity model and algorithm for multi-commodity flow supply chain network equilibrium with random demands
- Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
- Smoothing Newton method for generalized complementarity problems based on a new smoothing function
- An optimization model and method for supply chain equilibrium management problem
- Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem
- A sharper global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
- Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems
- A smoothing inexact Newton method for generalized nonlinear complementarity problem
- A new Jacobian-like method for the polyhedral cone-constrained eigenvalue problem
- Global error bound estimates algorithm for an \(R_0\)-type generalized LCP over polyhedral cone and its applications
- Generalized tensor complementarity problems over a polyhedral cone
- A smooth Newton method with 3-1 piecewise NCP function for generalized nonlinear complementarity problem
- Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
- A two-step new modulus-based matrix splitting method for vertical linear complementarity problem
- A neural network for the generalized nonlinear complementarity problem over a polyhedral cone
- A smoothing Newton-type method for generalized nonlinear complementarity problem
This page was built for publication: A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814939)