IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v195y2022i2d10.1007_s10957-022-02097-w.html
   My bibliography  Save this article

Pure Random Search with Virtual Extension of Feasible Region

Author

Listed:
  • E. A. Tsvetkov

    (Lebedev Physical Institute of the Russian Academy of Sciences)

  • R. A. Krymov

    (Moscow Institute of Physics and Technology)

Abstract

We propose a modification of the pure random search algorithm for cases when the global optimum point can be located near the boundary of a feasible region. If the feasible region is cube-shaped, the worst case occurs when the global optimum point is located at the vertex of a cube. In these cases, the sample size for the pure random search should be increased significantly because the success probability of the single trial is decreased. The proposed modification is based on the virtual extension of the feasible region. The extended region contains $$\varepsilon $$ ε -neighbourhoods of all points of the original region. All random points that fall outside the original feasible region are mapped to the nearest points on its boundary before the values of an objective function at these points are calculated. This extension of the feasible region also leads to an increase in the sample size due to the increased volume. We compare sample sizes required to hit into the neighbourhood of the global optimum point with a given probability for the proposed method and the original pure random search algorithm with a corrected sample size. We consider ball-shaped and cube-shaped feasible regions and find the sufficient conditions for the proposed algorithm to be more efficient. We offer a practical recommendation for cases, in which the feasible region is defined by a system of linear inequalities.

Suggested Citation

  • E. A. Tsvetkov & R. A. Krymov, 2022. "Pure Random Search with Virtual Extension of Feasible Region," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 575-595, November.
    • Handle: RePEc:spr:joptap:v:195:y:2022:i:2:d:10.1007_s10957-022-02097-w
    DOI: 10.1007/s10957-022-02097-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-022-02097-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-022-02097-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Donald R. Jones & Joaquim R. R. A. Martins, 2021. "The DIRECT algorithm: 25 years Later," Journal of Global Optimization, Springer, vol. 79(3), pages 521-566, March.
    2. Boris Polyak & Pavel Shcherbakov, 2017. "Why Does Monte Carlo Fail to Work Properly in High-Dimensional Optimization Problems?," Journal of Optimization Theory and Applications, Springer, vol. 173(2), pages 612-627, May.
    3. Francisco J. Solis & Roger J.-B. Wets, 1981. "Minimization by Random Search Techniques," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 19-30, February.
    4. Samuel H. Brooks, 1958. "A Discussion of Random Methods for Seeking Maxima," Operations Research, INFORMS, vol. 6(2), pages 244-251, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rinnooy Kan, A. H. G. & Timmer, G. T., 1985. "Stochastic Global Optimization Methods Part I: Clustering Methods," Econometric Institute Archives 272329, Erasmus University Rotterdam.
    2. Taymaz, Erol, 1993. "A Calibration Algorithm for Micro-Simulation Models," Working Paper Series 374, Research Institute of Industrial Economics.
    3. Giulia Pedrielli & K. Selcuk Candan & Xilun Chen & Logan Mathesen & Alireza Inanalouganji & Jie Xu & Chun-Hung Chen & Loo Hay Lee, 2019. "Generalized Ordinal Learning Framework (GOLF) for Decision Making with Future Simulated Data," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(06), pages 1-35, December.
    4. C. P. Stephens & W. Baritompa, 1998. "Global Optimization Requires Global Information," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 575-588, March.
    5. D. Bulger & W. P. Baritompa & G. R. Wood, 2003. "Implementing Pure Adaptive Search with Grover's Quantum Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 517-529, March.
    6. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    7. Hvattum, Lars Magnus & Glover, Fred, 2009. "Finding local optima of high-dimensional functions using direct search methods," European Journal of Operational Research, Elsevier, vol. 195(1), pages 31-45, May.
    8. Kyung-Yong Lee & Jung-Sung Park & Yun-Su Kim, 2021. "Optimal Placement of PMU to Enhance Supervised Learning-Based Pseudo-Measurement Modelling Accuracy in Distribution Network," Energies, MDPI, vol. 14(22), pages 1-18, November.
    9. Dillenburger, Steven P. & Cochran, Jeffery K. & Cammarano, Vincent R., 2013. "Minimizing supply airdrop collateral damage risk," Socio-Economic Planning Sciences, Elsevier, vol. 47(1), pages 9-19.
    10. Prietula, Michael J. & Watson, Harry S., 2008. "When behavior matters: Games and computation in A Behavioral Theory of the Firm," Journal of Economic Behavior & Organization, Elsevier, vol. 66(1), pages 74-94, April.
    11. Liu, Congzheng & Letchford, Adam N. & Svetunkov, Ivan, 2022. "Newsvendor problems: An integrated method for estimation and optimisation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 590-601.
    12. Pavel Shcherbakov & Mingyue Ding & Ming Yuchi, 2021. "Random Sampling Many-Dimensional Sets Arising in Control," Mathematics, MDPI, vol. 9(5), pages 1-16, March.
    13. Mojtaba Akbari & Saber Molla-Alizadeh-Zavardehi & Sadegh Niroomand, 2020. "Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network," Operational Research, Springer, vol. 20(1), pages 447-471, March.
    14. Linas Stripinis & Remigijus Paulavičius, 2023. "Novel Algorithm for Linearly Constrained Derivative Free Global Optimization of Lipschitz Functions," Mathematics, MDPI, vol. 11(13), pages 1-19, June.
    15. Sayantan Mukherjee & Nawaf F. Aljuwayhel & Sasmita Bal & Purna Chandra Mishra & Naser Ali, 2022. "Modelling, Analysis and Entropy Generation Minimization of Al 2 O 3 -Ethylene Glycol Nanofluid Convective Flow inside a Tube," Energies, MDPI, vol. 15(9), pages 1-24, April.
    16. Nazih-Eddine Belkacem & Lakhdar Chiter & Mohammed Louaked, 2024. "A Novel Approach to Enhance DIRECT -Type Algorithms for Hyper-Rectangle Identification," Mathematics, MDPI, vol. 12(2), pages 1-24, January.
    17. David E. Kaufman & Robert L. Smith, 1998. "Direction Choice for Accelerated Convergence in Hit-and-Run Sampling," Operations Research, INFORMS, vol. 46(1), pages 84-95, February.
    18. Pronzato, Luc & Walter, Eric & Venot, Alain & Lebruchec, Jean-Francois, 1984. "A general-purpose global optimizer: Implimentation and applications," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 26(5), pages 412-422.
    19. Liu, Xueying & Fu, Meiling, 2015. "Cuckoo search algorithm based on frog leaping local search and chaos theory," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 1083-1092.
    20. Ran Etgar & Yuval Cohen, 2022. "Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 249-271, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:195:y:2022:i:2:d:10.1007_s10957-022-02097-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.