A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function
DOI10.1007/S11075-011-9471-8zbMATH Open1279.90173OpenAlexW1997829969MaRDI QIDQ652335FDOQ652335
Authors: Jianguang Zhu, Hongwei Liu, Changhe Liu, Weijie Cong 
Publication date: 14 December 2011
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-011-9471-8
Recommendations
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function
- scientific article; zbMATH DE number 1569004
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- A family of NCP functions and a descent method for the nonlinear complementarity problem
nonlinear complementarity problemmodified Fischer-Burmeister functionnon-monoton derivative-free algorithm
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A Nonmonotone Line Search Technique for Newton’s Method
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A comparison of large scale mixed complementarity problem solvers
- On the resolution of monotone complementarity problems
- Unconstrained minimization approaches to nonlinear complementarity problems
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Title not available (Why is that?)
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- A penalized Fischer-Burmeister NCP-function
- Title not available (Why is that?)
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems.
- A linearly convergent derivative-free descent method for strongly monotone complementarity problems
Cited In (6)
- Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- Some results on the filter method for nonlinear complementary problems
- Penalized NCP-functions for nonlinear complementarity problems and a scaling algorithm
- A modified multivariate spectral gradient projection method for nonlinear complementarity problems
Uses Software
This page was built for publication: A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652335)
