 Stochastic Optimization MethodsRosario Toscano
Chapter Chapter 2 in Solving Optimization Problems with the Heuristic Kalman Algorithm, 2024, pp 21-45 from Springer Abstract: Abstract This chapter introduces some methods aimed at solving difficult optimization problems arising in many engineering fields. By difficult optimization problems, we mean those that are not convex. Recall that for the class of non-convex problems, there is no algorithm capable of guaranteeing, in reasonable a reasonable amount of time (By reasonable time, we mean polynomial in the size of the problem.), that the solution found is the global optimum. Under these conditions, we must be content with finding an acceptable solution. After introducing the notion of acceptable solution, a brief overview of the main stochastic methods which can be used for solving continuous non-convex constrained optimization problems is presented, i.e., Pure Random Search Methods (PRSM), Simulated Annealing (SA), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO). These methods are designed to produce an acceptable solution. The last part is dedicated to the problem of robust optimization, i.e., optimization in the presence of uncertainties on the problem data. Date: 2024 There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-52459-2_2 Ordering information: This item can be ordered from DOI: 10.1007/978-3-031-52459-2_2 Access Statistics for this chapter More chapters in Springer Optimization and Its Applications from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.