{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T12:03:47Z","timestamp":1777291427148,"version":"3.51.4"},"reference-count":23,"publisher":"Walter de Gruyter GmbH","issue":"2","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>A method is suggested to find all local minima and the global minimum of an unknown two-variable function bounded on a given rectangle regardless of the rectangle area. The method has eight inputs: five inputs defined straightforwardly and three inputs, which are adjustable. The endpoints of the initial intervals constituting the rectangle and a formula for evaluating the two-variable function at any point of this rectangle are the straightforward inputs. The three adjustable inputs are a tolerance with the minimal and maximal numbers of subintervals along each dimension. The tolerance is the secondary adjustable input. Having broken the initial rectangle into a set of subrectangles, the nine-point iterated rectangle dichotomy \u201cgropes\u201d around every local minimum by successively cutting off 75 % of the subrectangle area or dividing the subrectangle in four. A range of subrectangle sets defined by the minimal and maximal numbers of subintervals along each dimension is covered by running the nine-point rectangle dichotomy on every set of subrectangles. As a set of values of currently found local minima points changes no more than by the tolerance, the set of local minimum points and the respective set of minimum values of the surface are returned. The presented approach is applicable to whichever task of finding local extrema is. If primarily the purpose is to find all local maxima or the global maximum of the two-variable function, the presented approach is applied to the function taken with the negative sign. The presented approach is a significant and important contribution to the field of numerical estimation and approximate analysis. Although the method does not assure obtaining all local minima (or maxima) for any two-variable function, setting appropriate minimal and maximal numbers of subintervals makes missing some minima (or maxima) very unlikely.<\/jats:p>","DOI":"10.2478\/acss-2022-0010","type":"journal-article","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:32:25Z","timestamp":1674559945000},"page":"89-100","source":"Crossref","is-referenced-by-count":0,"title":["Nine-Point Iterated Rectangle Dichotomy for Finding All Local Minima of Unknown Bounded Surface"],"prefix":"10.2478","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3543-3087","authenticated-orcid":false,"given":"Vadim","family":"Romanuke","sequence":"first","affiliation":[{"name":"Polish Naval Academy , Gdynia , Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2023,1,24]]},"reference":[{"key":"2026042709093326848_j_acss-2022-0010_ref_001","unstructured":"[1] M. L. Lial, R. N. Greenwell, and N. P. Ritchey, Calculus with Applications (11th edition). Pearson, 2016."},{"key":"2026042709093326848_j_acss-2022-0010_ref_002","unstructured":"[2] L. D. Hoffmann, G. L. Bradley, and K. H. Rosen, Applied Calculus for Business, Economics, and the Social and Life Sciences. McGraw-Hill Higher Education, 2005."},{"key":"2026042709093326848_j_acss-2022-0010_ref_003","doi-asserted-by":"crossref","unstructured":"[3] S. A. Vavasis, \u201cComplexity issues in global optimization: A survey,\u201d in Handbook of Global Optimization. Nonconvex Optimization and Its Applications, vol. 2, R. Horst and P. M. Pardalos, Eds. Springer, Boston, MA, 1995, pp. 27\u201341. https:\/\/doi.org\/10.1007\/978-1-4615-2025-2_2","DOI":"10.1007\/978-1-4615-2025-2_2"},{"key":"2026042709093326848_j_acss-2022-0010_ref_004","unstructured":"[4] J. Stewart, Calculus: Early Transcendentals (6th edition). Brooks\/Cole, 2008."},{"key":"2026042709093326848_j_acss-2022-0010_ref_005","doi-asserted-by":"crossref","unstructured":"[5] E. Hewitt and K. R. Stromberg, Real and Abstract Analysis. Springer, 1965. https:\/\/doi.org\/10.1007\/978-3-642-88044-5","DOI":"10.1007\/978-3-642-88047-6"},{"key":"2026042709093326848_j_acss-2022-0010_ref_006","unstructured":"[6] K. R. Stromberg, Introduction to Classical Real Analysis. Wadsworth, 1981."},{"key":"2026042709093326848_j_acss-2022-0010_ref_007","unstructured":"[7] R. Fletcher, Practical Methods of Optimization (2nd edition). J. Wiley and Sons, Chichester, 1987."},{"key":"2026042709093326848_j_acss-2022-0010_ref_008","doi-asserted-by":"crossref","unstructured":"[8] J. Kiefer, \u201cSequential minimax search for a maximum,\u201d Proceedings of the American Mathematical Society, vol. 4, no. 3, pp. 502\u2013506, 1953. https:\/\/doi.org\/10.2307\/2032161","DOI":"10.1090\/S0002-9939-1953-0055639-3"},{"key":"2026042709093326848_j_acss-2022-0010_ref_009","doi-asserted-by":"crossref","unstructured":"[9] M. Avriel and D. J. Wilde, \u201cOptimality proof for the symmetric Fibonacci search technique,\u201d Fibonacci Quarterly, no. 4, pp. 265\u2013269, 1966.10.1080\/00150517.1966.12431364","DOI":"10.1080\/00150517.1966.12431364"},{"key":"2026042709093326848_j_acss-2022-0010_ref_010","unstructured":"[10] W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, \u201cMinimization or maximization of functions,\u201d in Numerical Recipes: The Art of Scientific Computing (3rd edition), Cambridge University Press, New York, 2007, pp. 487\u2013562."},{"key":"2026042709093326848_j_acss-2022-0010_ref_011","doi-asserted-by":"crossref","unstructured":"[11] K. J. Overholt, \u201cEfficiency of the Fibonacci search method,\u201d BIT Numerical Mathematics, vol. 13, no. 1, pp. 92\u201396, Mar. 1973. https:\/\/doi.org\/10.1007\/BF01933527","DOI":"10.1007\/BF01933527"},{"key":"2026042709093326848_j_acss-2022-0010_ref_012","doi-asserted-by":"crossref","unstructured":"[12] S. Edelkamp and S. Schr\u00f6dl, \u201cChapter 7 \u2013 Symbolic search,\u201d in Heuristic Search, S. Edelkamp, S. Schr\u00f6dl, Eds. Morgan Kaufmann, 2012, pp. 283\u2013318. https:\/\/doi.org\/10.1016\/B978-0-12-372512-7.00007-9","DOI":"10.1016\/B978-0-12-372512-7.00007-9"},{"key":"2026042709093326848_j_acss-2022-0010_ref_013","doi-asserted-by":"crossref","unstructured":"[13] \u015e. E. Amrahov, A. S. Mohammed, and F. V. \u00c7elebi, \u201cNew and improved search algorithms and precise analysis of their average-case complexity,\u201d Future Generation Computer Systems, vol. 95, pp. 743\u2013753, Jun. 2019. https:\/\/doi.org\/10.1016\/j.future.2019.01.043","DOI":"10.1016\/j.future.2019.01.043"},{"key":"2026042709093326848_j_acss-2022-0010_ref_014","doi-asserted-by":"crossref","unstructured":"[14] G. S. Rani, S. Jayan, and K. V. Nagaraja, \u201cAn extension of golden section algorithm for n-variable functions with MATLAB code,\u201d in IOP Conf. Series: Materials Science and Engineering, IOP Publishing, 2019, vol. 577, Art. no. 012175. https:\/\/doi.org\/10.1088\/1757-899X\/577\/1\/012175","DOI":"10.1088\/1757-899X\/577\/1\/012175"},{"key":"2026042709093326848_j_acss-2022-0010_ref_015","doi-asserted-by":"crossref","unstructured":"[15] A. Kheldoun, R. Bradai, R. Boukenoui, and A. Mellit, \u201cA new Golden Section method-based maximum power point tracking algorithm for photovoltaic systems,\u201d Energy Conversion and Management, no. 111, pp. 125\u2013136, Mar. 2016. https:\/\/doi.org\/10.1016\/j.enconman.2015.12.039","DOI":"10.1016\/j.enconman.2015.12.039"},{"key":"2026042709093326848_j_acss-2022-0010_ref_016","doi-asserted-by":"crossref","unstructured":"[16] J.-D. Lee, C.-H. Chen, J.-Y. Lee, L.-M. Chien, and Y.-Y. Sun, \u201cThe Fibonacci search for cornerpoint detection of two-dimensional images,\u201d Mathematical and Computer Modelling: An International Journal, vol. 16, no. 11, pp. 15\u201320, Nov. 1992. https:\/\/doi.org\/10.1016\/0895-7177(92)90102-Q","DOI":"10.1016\/0895-7177(92)90102-Q"},{"key":"2026042709093326848_j_acss-2022-0010_ref_017","doi-asserted-by":"crossref","unstructured":"[17] L. D. Chambers, Ed. The Practical Handbook of Genetic Algorithms: Applications (2nd edition). Chapman and Hall\/CRC, 2000. https:\/\/doi.org\/10.1201\/9781420035568","DOI":"10.1201\/9781420035568"},{"key":"2026042709093326848_j_acss-2022-0010_ref_018","unstructured":"[18] D. E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley, 1989."},{"key":"2026042709093326848_j_acss-2022-0010_ref_019","doi-asserted-by":"crossref","unstructured":"[19] R. Horst and P. M. Pardalos, Eds., Handbook of Global Optimization. Nonconvex Optimization and Its Applications, vol. 2. Springer, Boston, MA, 1995. https:\/\/doi.org\/10.1007\/978-1-4615-2025-2","DOI":"10.1007\/978-1-4615-2025-2"},{"key":"2026042709093326848_j_acss-2022-0010_ref_020","doi-asserted-by":"crossref","unstructured":"[20] F. Neri, G. Iacca, and E. Mininno, \u201cCompact optimization\u201d in Handbook of Optimization. From Classical to Modern Approach, I. Zelinka, V. Sn\u00e1\u0161el, and A. Abraham, Eds. Springer-Verlag Berlin Heidelberg, 2013, pp. 337\u2013364. https:\/\/doi.org\/10.1007\/978-3-642-30504-7_14","DOI":"10.1007\/978-3-642-30504-7_14"},{"key":"2026042709093326848_j_acss-2022-0010_ref_021","doi-asserted-by":"crossref","unstructured":"[21] C. Thornton, F. Hutter, H. H. Hoos, and K. Leyton-Brown, \u201cAuto-WEKA: Combined selection and hyperparameter optimization of classification algorithms,\u201d in KDD\u201913 Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, Chicago, Illinois, USA, Aug. 2013, pp. 847\u2013855. https:\/\/doi.org\/10.1145\/2487575.2487629","DOI":"10.1145\/2487575.2487629"},{"key":"2026042709093326848_j_acss-2022-0010_ref_022","doi-asserted-by":"crossref","unstructured":"[22] H. Cai, J. Lin, and S. Han, \u201cChapter 4 \u2013 Efficient methods for deep learning,\u201d in Computer Vision and Pattern Recognition. Advanced Methods and Deep Learning in Computer Vision, E. R. Davies and M. A. Turk, Eds. Academic Press, 2022, pp. 159\u2013190. https:\/\/doi.org\/10.1016\/B978-0-12-822109-9.00013-8","DOI":"10.1016\/B978-0-12-822109-9.00013-8"},{"key":"2026042709093326848_j_acss-2022-0010_ref_023","doi-asserted-by":"crossref","unstructured":"[23] J. Waring, C. Lindvall, and R. Umeton, \u201cAutomated machine learning: Review of the state-of-the-art and opportunities for healthcare,\u201d Artificial Intelligence in Medicine, vol. 104, Art. no. 101822, Apr. 2020. https:\/\/doi.org\/10.1016\/j.artmed.2020.10182232499001","DOI":"10.1016\/j.artmed.2020.101822"}],"container-title":["Applied Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/reference-global.com\/pdf\/10.2478\/acss-2022-0010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:28:42Z","timestamp":1777289322000},"score":1,"resource":{"primary":{"URL":"https:\/\/reference-global.com\/article\/10.2478\/acss-2022-0010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,1]]},"references-count":23,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,1,24]]},"published-print":{"date-parts":[[2022,12,1]]}},"alternative-id":["10.2478\/acss-2022-0010"],"URL":"https:\/\/doi.org\/10.2478\/acss-2022-0010","relation":{},"ISSN":["2255-8691"],"issn-type":[{"value":"2255-8691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,1]]}}}