A particle swarm-BFGS algorithm for nonlinear programming problems
From MaRDI portal
Publication:340297
DOI10.1016/J.COR.2012.11.008zbMath1349.90866OpenAlexW1992682665MaRDI QIDQ340297
Roohollah Aliakbari Shandiz, Abdolhamid Eshraghniaye Jahromi, Ali Mohammad Nezhad
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
nonlinear programmingparticle swarm optimizationactive set SQP algorithmaugmented Lagrangian penalty functionBFGS algorithminterior/CG algorithm
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
An adaptive penalty based covariance matrix adaptation-evolution strategy ⋮ Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning ⋮ 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 ⋮ Two penalized mixed-integer nonlinear programming approaches to tackle multicollinearity and outliers effects in linear regression models ⋮ A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM ⋮ Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
This page was built for publication: A particle swarm-BFGS algorithm for nonlinear programming problems
