Particle swarm optimization-proximal point algorithm for nonlinear complementarity problems
From MaRDI portal
Recommendations
- An improved particle swarm optimization algorithm for solving complementary problems
- Modified proximal-point method for nonlinear complementarity problems
- An interior proximal point algorithm for nonlinear complementarity problems
- Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function
- scientific article; zbMATH DE number 1842043
Cites work
- scientific article; zbMATH DE number 3692141 (Why is no real title available?)
- scientific article; zbMATH DE number 1950377 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A positive interior-point algorithm for nonlinear complementarity problems.
- Entropy method for one sort of nonlinear minimax problem
- Improved particle swarm optimization for class of nonlinear min-max problems
- Jacobian Smoothing Methods for Nonlinear Complementarity Problems
- Monotone Operators and the Proximal Point Algorithm
- On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
- The new advances in methods for complementarity problems.
Cited in
(4)- An improved particle swarm optimization algorithm for solving complementary problems
- A particle swarm-BFGS algorithm for nonlinear programming problems
- A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems
- An application of swarm optimization to nonlinear programming
This page was built for publication: Particle swarm optimization-proximal point algorithm for nonlinear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474647)