A PRACTICAL APPROACH TO OPTIMIZATION

Authors

  • W. Jirakitpuwapat National Security and Dual-Use Technology Center, National Science and Technology Development Agency (NSTDA), Phathum Thani, 12120, Thailand
  • P. Kumam Center of Excellence in Theoretical and Computational Science (TaCS-CoE), Science Laboratory Building, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand; KMUTTFixed Point Research Laboratory, KMUTT-Fixed Point Theory and Applications Research Group, SCL 802 Fixed Point Laboratory, Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand
  • K. Khammahawong Center of Excellence in Theoretical and Computational Science (TaCS-CoE), Science Laboratory Building, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand; NCAO Research Center, Fixed Point Theory and Applications Research Group, Center of Excellence in Theoretical and Computational Science (TaCS-CoE), Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha Uthit Rd., Bang Mod, Thung Khru, Bangkok 10140, Thailand
  • S. Dhompongsa Center of Excellence in Theoretical and Computational Science (TaCS-CoE), Science Laboratory Building, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand; KMUTTFixed Point Research Laboratory, KMUTT-Fixed Point Theory and Applications Research Group, SCL 802 Fixed Point Laboratory, Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand

Keywords:

convex algorithm, optimization, particle swarm optimization, pattern-search

Abstract

We present a new approach for finding a minimal value of an arbitrary function assuming only its continuity. The process avoids verifying Lagrange- or KKT-conditions. The method enables us to obtain a Brouwer fixed point (of a continuous function mapping from a cube into itself).

Additional Files

Published

04/01/2021

Issue

Vol. 12 No. 1 (2021): JNAO

Section

Research Articles

License

Copyright (c) 2024 Journal of Nonlinear Analysis and Optimization: Theory & Applications (JNAO)

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Copyright (c) 2010 Journal of Nonlinear Analysis and Optimization: Theory & Applications

Creative Commons License

This work is licensed under aย Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.