An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives

DOI10.1007/s00158-005-0552-yzbMath1245.90162OpenAlexW2058288947MaRDI QIDQ445473

M. K. M. Rahman

Publication date: 25 August 2012

Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00158-005-0552-y

zbMATH Keywords

optimization algorithm

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Uses Software

• fminsearch

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Test examples for nonlinear programming codes
• An SQP method for general nonlinear programs using only equality constrained subproblems
• Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
• On Descent from Local Minima
• A Simplex Method for Function Minimization

This page was built for publication: An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives