IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v390y2021ics0096300320305762.html
   My bibliography  Save this article

Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics

Author

Listed:
  • Lera, Daniela
  • Posypkin, Mikhail
  • Sergeyev, Yaroslav D.

Abstract

The problem of approximating and visualizing the solution set of systems of nonlinear inequalities can be frequently met in practice, in particular, when it is required to find the working space of some robots. In this paper, a method using Peano-Hilbert space-filling curves for the dimensionality reduction has been proposed for functions satisfying the Lipschitz condition. Theoretical properties of the introduced algorithm showing advantages of this reduction in the context of the present problem have been established and convergence properties of this method have been studied. A number of experiments executed on test functions and problems regarding finding workspace of robots confirm theoretical results and show a promising character of the new methodology.

Suggested Citation

  • Lera, Daniela & Posypkin, Mikhail & Sergeyev, Yaroslav D., 2021. "Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    • Handle: RePEc:eee:apmaco:v:390:y:2021:i:c:s0096300320305762
    DOI: 10.1016/j.amc.2020.125660
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320305762
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125660?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. Grishagin, Vladimir & Israfilov, Ruslan & Sergeyev, Yaroslav, 2018. "Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 270-280.
    2. Yuri Evtushenko & Mikhail Posypkin & Larisa Rybak & Andrei Turkin, 2018. "Approximating a solution set of nonlinear inequalities," Journal of Global Optimization, Springer, vol. 71(1), pages 129-145, May.
    3. Konstantin Barkalov & Roman Strongin, 2018. "Solving a set of global optimization problems by the parallel technique with uniform convergence," Journal of Global Optimization, Springer, vol. 71(1), pages 21-36, May.
    4. Daniela Lera & Yaroslav D. Sergeyev, 2018. "GOSH: derivative-free global optimization using multi-dimensional space-filling curves," Journal of Global Optimization, Springer, vol. 71(1), pages 193-211, May.
    5. Remigijus Paulavičius & Yaroslav Sergeyev & Dmitri Kvasov & Julius Žilinskas, 2014. "Globally-biased Disimpl algorithm for expensive global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 545-567, July.
    6. James M. Calvin & Yvonne Chen & Antanas Žilinskas, 2012. "An Adaptive Univariate Global Optimization Algorithm and Its Convergence Rate for Twice Continuously Differentiable Functions," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 628-636, November.
    7. Anatoly Zhigljavsky & Antanas Žilinskas, 2008. "Stochastic Global Optimization," Springer Optimization and Its Applications, Springer, number 978-0-387-74740-8, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mikhail Posypkin & Oleg Khamisov, 2021. "Automatic Convexity Deduction for Efficient Function’s Range Bounding," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    2. Naveed Ishtiaq Chaudhary & Muhammad Asif Zahoor Raja & Zeshan Aslam Khan & Khalid Mehmood Cheema & Ahmad H. Milyani, 2021. "Hierarchical Quasi-Fractional Gradient Descent Method for Parameter Estimation of Nonlinear ARX Systems Using Key Term Separation Principle," Mathematics, MDPI, vol. 9(24), pages 1-14, December.

    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. Yaroslav D. Sergeyev & Marat S. Mukhametzhanov & Dmitri E. Kvasov & Daniela Lera, 2016. "Derivative-Free Local Tuning and Local Improvement Techniques Embedded in the Univariate Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 186-208, October.
    2. Sergeyev, Yaroslav D. & Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2017. "Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 141(C), pages 96-109.
    3. Daniela Lera & Yaroslav D. Sergeyev, 2018. "GOSH: derivative-free global optimization using multi-dimensional space-filling curves," Journal of Global Optimization, Springer, vol. 71(1), pages 193-211, May.
    4. Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2018. "Metaheuristic vs. deterministic global optimization algorithms: The univariate case," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 245-259.
    5. 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.
    6. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    7. James Calvin & Gražina Gimbutienė & William O. Phillips & Antanas Žilinskas, 2018. "On convergence rate of a rectangular partition based global optimization algorithm," Journal of Global Optimization, Springer, vol. 71(1), pages 165-191, May.
    8. R. Cavoretto & A. Rossi & M. S. Mukhametzhanov & Ya. D. Sergeyev, 2021. "On the search of the shape parameter in radial basis functions using univariate global optimization methods," Journal of Global Optimization, Springer, vol. 79(2), pages 305-327, February.
    9. James M. Calvin & Antanas Žilinskas, 2014. "On a Global Optimization Algorithm for Bivariate Smooth Functions," Journal of Optimization Theory and Applications, Springer, vol. 163(2), pages 528-547, November.
    10. Vasiliy V. Grigoriev & Petr N. Vabishchevich, 2021. "Bayesian Estimation of Adsorption and Desorption Parameters for Pore Scale Transport," Mathematics, MDPI, vol. 9(16), pages 1-16, August.
    11. Rudolf Scitovski, 2017. "A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set," Journal of Global Optimization, Springer, vol. 68(4), pages 713-727, August.
    12. Rudolf Scitovski & Kristian Sabo, 2019. "Application of the DIRECT algorithm to searching for an optimal k-partition of the set $$\mathcal {A}\subset \mathbb {R}^n$$ A ⊂ R n and its application to the multiple circle detection problem," Journal of Global Optimization, Springer, vol. 74(1), pages 63-77, May.
    13. G. Liuzzi & S. Lucidi & V. Piccialli, 2016. "Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization," Computational Optimization and Applications, Springer, vol. 65(2), pages 449-475, November.
    14. Konstantin Barkalov & Roman Strongin, 2018. "Solving a set of global optimization problems by the parallel technique with uniform convergence," Journal of Global Optimization, Springer, vol. 71(1), pages 21-36, May.
    15. Konstantin Barkalov & Irek Gubaydullin & Evgeny Kozinov & Ilya Lebedev & Roza Faskhutdinova & Azamat Faskhutdinov & Leniza Enikeeva, 2022. "On Solving the Problem of Finding Kinetic Parameters of Catalytic Isomerization of the Pentane-Hexane Fraction Using a Parallel Global Search Algorithm," Mathematics, MDPI, vol. 10(19), pages 1-13, October.
    16. E. F. Campana & M. Diez & G. Liuzzi & S. Lucidi & R. Pellegrini & V. Piccialli & F. Rinaldi & A. Serani, 2018. "A multi-objective DIRECT algorithm for ship hull optimization," Computational Optimization and Applications, Springer, vol. 71(1), pages 53-72, September.
    17. Jonas Mockus & Remigijus Paulavičius & Dainius Rusakevičius & Dmitrij Šešok & Julius Žilinskas, 2017. "Application of Reduced-set Pareto-Lipschitzian Optimization to truss optimization," Journal of Global Optimization, Springer, vol. 67(1), pages 425-450, January.
    18. Moody Chu & Matthew Lin & Liqi Wang, 2014. "A study of singular spectrum analysis with global optimization techniques," Journal of Global Optimization, Springer, vol. 60(3), pages 551-574, November.
    19. Victor Gergel & Evgeny Kozinov, 2018. "Efficient multicriterial optimization based on intensive reuse of search information," Journal of Global Optimization, Springer, vol. 71(1), pages 73-90, May.
    20. Ferreiro-Ferreiro, Ana M. & García-Rodríguez, José A. & Souto, Luis & Vázquez, Carlos, 2019. "Basin Hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 282-298.

    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:eee:apmaco:v:390:y:2021:i:c:s0096300320305762. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.