IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v180y2019i3d10.1007_s10957-018-1414-2.html
   My bibliography  Save this article

Variational Analysis on the Signed Distance Functions

Author

Listed:
  • Honglin Luo

    (Chongqing Normal University)

  • Xianfu Wang

    (University of British Columbia
    Southwest University)

  • Brett Lukens

    (University of British Columbia)

Abstract

The signed distance function (or oriented distance function) of a set in a metric space determines the distance of a given point from the boundary of the set, with the sign determined by whether the point is in the set or in its complement. The knowledge of signed distance functions is a very valuable information in various fields of applied mathematics such as collision detection, binary classification, shape analysis, fuzzy numbers ranking and level set methods. One distinguished feature of the signed distance function is that it reflects the geometric structure of the set much better than the distance function does. We explore many interesting analytical properties of signed distance functions and use them to construct convex functions with not convex subdifferential domains. Several examples are presented to illustrate most of these fine properties.

Suggested Citation

  • Honglin Luo & Xianfu Wang & Brett Lukens, 2019. "Variational Analysis on the Signed Distance Functions," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 751-774, March.
  • Handle: RePEc:spr:joptap:v:180:y:2019:i:3:d:10.1007_s10957-018-1414-2
    DOI: 10.1007/s10957-018-1414-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-018-1414-2
    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-018-1414-2?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. Lkhamsuren Altangerel & Gert Wanka & Oleg Wilfer, 2013. "An Oriented Distance Function Application to Gap Functions for Vector Variational Inequalities," Springer Optimization and Its Applications, in: Altannar Chinchuluun & Panos M. Pardalos & Rentsen Enkhbat & E. N. Pistikopoulos (ed.), Optimization, Simulation, and Control, edition 127, pages 17-34, Springer.
    2. J. B. Hiriart-Urruty, 1979. "Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces," Mathematics of Operations Research, INFORMS, vol. 4(1), pages 79-97, February.
    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. Qamrul Hasan Ansari & Pradeep Kumar Sharma, 2022. "Some Properties of Generalized Oriented Distance Function and their Applications to Set Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 247-279, June.

    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. Marius Durea & Radu Strugariu & Christiane Tammer, 2013. "Scalarization in Geometric and Functional Vector Optimization Revisited," Journal of Optimization Theory and Applications, Springer, vol. 159(3), pages 635-655, December.
    2. Thai Chuong, 2013. "Newton-like methods for efficient solutions in vector optimization," Computational Optimization and Applications, Springer, vol. 54(3), pages 495-516, April.
    3. P. Q. Khanh & N. D. Tuan, 2007. "Optimality Conditions for Nonsmooth Multiobjective Optimization Using Hadamard Directional Derivatives," Journal of Optimization Theory and Applications, Springer, vol. 133(3), pages 341-357, June.
    4. Bolte, Jérôme & Le, Tam & Pauwels, Edouard & Silveti-Falls, Antonio, 2022. "Nonsmooth Implicit Differentiation for Machine Learning and Optimization," TSE Working Papers 22-1314, Toulouse School of Economics (TSE).
    5. Khushboo & C. S. Lalitha, 2018. "Scalarizations for a unified vector optimization problem based on order representing and order preserving properties," Journal of Global Optimization, Springer, vol. 70(4), pages 903-916, April.
    6. Ginchev Ivan & Guerraggio Angelo & Rocca Matteo, 2003. "First-Order Conditions for C0,1 Constrained vector optimization," Economics and Quantitative Methods qf0307, Department of Economics, University of Insubria.
    7. Yang-Dong Xu & Cheng-Ling Zhou & Sheng-Kun Zhu, 2021. "Image Space Analysis for Set Optimization Problems with Applications," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 311-343, October.
    8. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2020. "Robustness Characterizations for Uncertain Optimization Problems via Image Space Analysis," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 459-479, August.
    9. M. J. Cánovas & M. A. López & J. Parra & F. J. Toledo, 2006. "Distance to Ill-Posedness in Linear Optimization via the Fenchel-Legendre Conjugate," Journal of Optimization Theory and Applications, Springer, vol. 130(2), pages 173-183, August.
    10. S. K. Zhu & S. J. Li, 2014. "Unified Duality Theory for Constrained Extremum Problems. Part II: Special Duality Schemes," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 763-782, June.
    11. Qamrul Hasan Ansari & Pradeep Kumar Sharma, 2022. "Some Properties of Generalized Oriented Distance Function and their Applications to Set Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 247-279, June.
    12. Onetti Alberto & Verma Sameer, 2008. "Licensing and Business Models," Economics and Quantitative Methods qf0806, Department of Economics, University of Insubria.
    13. Elisa Caprari & Lorenzo Cerboni Baiardi & Elena Molho, 2022. "Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach," Journal of Global Optimization, Springer, vol. 84(2), pages 295-320, October.
    14. Rocca Matteo & Papalia Melania, 2008. "Well-posedness in vector optimization and scalarization results," Economics and Quantitative Methods qf0807, Department of Economics, University of Insubria.
    15. Xu, Y.D. & Li, S.J. & Teo, K.L., 2012. "Vector network equilibrium problems with capacity constraints of arcs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 567-577.
    16. S. J. Li & Y. D. Xu & S. K. Zhu, 2012. "Nonlinear Separation Approach to Constrained Extremum Problems," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 842-856, September.
    17. Crespi Giovanni P. & Ginchev Ivan & Rocca Matteo, 2004. "Variational inequalities in vector optimization," Economics and Quantitative Methods qf04020, Department of Economics, University of Insubria.
    18. Giovanni Paolo Crespi & Andreas H. Hamel & Matteo Rocca & Carola Schrage, 2021. "Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 361-381, February.
    19. Giorgio Giorgi, 2021. "On Notations for Conic Hulls and Related Considerations on Tangent Cones," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 13(3), pages 1-13, June.
    20. Ning E. & Wen Song & Yu Zhang, 2012. "Second order sufficient optimality conditions in vector optimization," Journal of Global Optimization, Springer, vol. 54(3), pages 537-549, November.

    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:180:y:2019:i:3:d:10.1007_s10957-018-1414-2. 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.