Particle swarm optimization-proximal point algorithm for nonlinear complementarity problems

DOI10.1155/2013/808965zbMath1299.90403OpenAlexW2054259196WikidataQ59030259 ScholiaQ59030259MaRDI QIDQ474647

Shu-Yan Wang, Jun-Feng Chai

Publication date: 24 November 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/808965

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Entropy method for one sort of nonlinear minimax problem
• A positive interior-point algorithm for nonlinear complementarity problems.
• On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
• Improved particle swarm optimization for class of nonlinear min-max problems
• Monotone Operators and the Proximal Point Algorithm
• Jacobian Smoothing Methods for Nonlinear Complementarity Problems
• A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Particle swarm optimization-proximal point algorithm for nonlinear complementarity problems