An R -linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer–Burmeister merit function

In the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the nonlinear complementarity problem, Computational Optimization and Applications, 40 (2008) 389–404], the authors proposed a derivative-free descent algorithm for nonlinear complementarity problems (NCPs) by the g...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computational and applied mathematics Vol. 232; no. 2; pp. 455 - 471
Main Authors:	Chen, Jein-Shan, Gao, Hung-Ta, Pan, Shaohua
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier B.V 15.10.2009 Elsevier
Subjects:	Calculus of variations and optimal control Convergence rate Exact sciences and technology Functional analysis Functions of a complex variable Global error bound Mathematical analysis Mathematics Merit function NCP-function Nonlinear complementarity problem Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Sciences and techniques of general use Convergence rate Nonlinear complementarity problem Global error bound Merit function NCP-function Error estimation Convergence acceleration Optimization method Complementarity problem Nonlinear problems Algorithm Penalty method Convergence Numerical analysis Algorithm performance Applied mathematics Descent method Mathematical programming
ISSN:	0377-0427, 1879-1778
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!