A particle swarm-BFGS algorithm for nonlinear programming problems

DOI10.1016/J.COR.2012.11.008MaRDI QIDQ340297zbMATH OpenOpenAlexFDO

Authors Ali Mohammad Nezhad, Roohollah Aliakbari Shandiz, Abdolhamid Eshraghniaye Jahromi

Publication date 14 November 2016

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

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

zbMATH Keywords

active set SQP algorithmaugmented Lagrangian penalty functionBFGS algorithminterior/CG algorithmnonlinear programmingparticle swarm optimization

Mathematics Subject Classification ID

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

Recommendations

• A hybrid particle swarm algorithm of nonlinear constraint optimization problems
• A hybrid particle swarm optimization algorithm for mixed-integer nonlinear programming
• A modified particle swarm optimization algorithm for nonlinear optimization
• Particle swarm algorithm of the nonlinear programming problem
• Particle swarm optimization-proximal point algorithm for nonlinear complementarity problems

Cited in

(11)

• Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
• Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
• A hybrid quasi-Newton method with application in sparse recovery
• Application of particle swarm optimization based on CHKS smoothing function for solving nonlinear bilevel programming problem
• Two penalized mixed-integer nonlinear programming approaches to tackle multicollinearity and outliers effects in linear regression models
• Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm
• An adaptive penalty based covariance matrix adaptation-evolution strategy
• Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning
• A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM
• 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: A particle swarm-BFGS algorithm for nonlinear programming problems

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