A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems

DOI10.1016/J.COR.2010.11.007MaRDI QIDQ632650zbMATH OpenOpenAlexFDO

Authors Ali Mohammad Nezhad, Hashem Mahlooji

Publication date 25 March 2011

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2010.11.007

zbMATH Keywords

nonlinear programmingparticle swarm optimizationdiscrete Lagrange multiplierspriority based feasibility strategy

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30)

Recommendations

• Using quantum-behaved particle swarm optimization algorithm to solve non-linear programming problems
• A particle swarm-BFGS algorithm for nonlinear programming problems
• A trajectory-based method for constrained nonlinear optimization problems
• An improved particle swarm optimization algorithm for solving constrained optimization problems
• Particle swarm optimization-proximal point algorithm for nonlinear complementarity problems

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3562783 (Why is no real title available?)
• scientific article; zbMATH DE number 1487974 (Why is no real title available?)
• scientific article; zbMATH DE number 3197060 (Why is no real title available?)
• A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization
• An application of swarm optimization to nonlinear programming
• Constraint handling in genetic algorithms using a gradient-based repair method
• Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
• Nonlinear Programming
• Simulated annealing with asymptotic convergence for nonlinear constrained optimization
• Solving nonlinearly constrained global optimization problem via an auxiliary function method
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

Cited in

(3)

• Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm
• Using quantum-behaved particle swarm optimization algorithm to solve non-linear programming problems
• A multi-stage descent algorithm for discrete and continuous optimization applied to truss structures optimal design

This page was built for publication: A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632650)