A comparative study on optimization methods for the constrained nonlinear programming problems

DOI10.1155/MPE.2005.165MaRDI QIDQ2500852zbMATH OpenOpenAlexFDO

Authors Özgür Yeniay

Publication date 28 August 2006

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/53255

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Quadratic programming (90C20) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Constrained nonlinear programming problems often arise in many engineering applications. The most well-known optimization methods for solving these problems are sequential quadratic programming methods and generalized reduced gradient methods. This study compares the performance of these methods with the genetic algorithms which gained popularity in recent years due to advantages in speed and robustness. We present a comparative study that is performed on fifteen test problems selected from the literature.

Recommendations

• Programacion no lineal
• A constraint method in nonlinear multi-objective optimization
• A comparative study of several semi-infinite nonlinear programming algorithms
• scientific article; zbMATH DE number 124136
• scientific article; zbMATH DE number 4112398
• Publication:3471864
• scientific article; zbMATH DE number 151663
• scientific article; zbMATH DE number 176308
• scientific article; zbMATH DE number 4156221
• scientific article; zbMATH DE number 1488893

Cited in

(7)

• Best practices for comparing optimization algorithms
• A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
• A stochastic approach to general nonlinear programming problems
• COMPARATIVE EVALUATION OF DIFFERENT OPTIMIZATION ALGORITHMS FOR STRUCTURAL DESIGN APPLICATIONS
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• Self-adaptive velocity particle swarm optimization for solving constrained optimization problems
• The oracle penalty method

This page was built for publication: A comparative study on optimization methods for the constrained nonlinear programming problems

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