Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function

DOI10.3934/JIMO.2013.9.153zbMath1264.49035OpenAlexW2315426537MaRDI QIDQ1950057

Jia Wu, Jein-Shan Chen, Yu-Lin Chang

Publication date: 24 May 2013

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2013.9.153

zbMATH Keywords

proximal point algorithmcomplementarity problemapproximation criterion

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming

This page was built for publication: Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function