IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v164y2015i1d10.1007_s10957-014-0582-y.html
   My bibliography  Save this article

On Local Coincidence of a Convex Set and its Tangent Cone

Author

Listed:
  • Kaiwen Meng

    (Southwest Jiaotong University)

  • Vera Roshchina

    (Federation University Australia)

  • Xiaoqi Yang

    (The Hong Kong Polytechnic University)

Abstract

In this paper, we introduce the exact tangent approximation property for a convex set and provide its characterizations, including the nonzero extent of a convex set. We obtain necessary and sufficient conditions for the closedness of the positive hull of a convex set via a limit set defined by truncated upper level sets of the gauge function. We also apply the exact tangent approximation property to study the existence of a global error bound for a proper, lower semicontinuous and positively homogeneous function.

Suggested Citation

  • Kaiwen Meng & Vera Roshchina & Xiaoqi Yang, 2015. "On Local Coincidence of a Convex Set and its Tangent Cone," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 123-137, January.
    • Handle: RePEc:spr:joptap:v:164:y:2015:i:1:d:10.1007_s10957-014-0582-y
    DOI: 10.1007/s10957-014-0582-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-014-0582-y
    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-014-0582-y?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. Hui Hu & Qing Wang, 2011. "Closedness of a Convex Cone and Application by Means of the End Set of a Convex Set," Journal of Optimization Theory and Applications, Springer, vol. 151(3), pages 633-645, December.
    2. Hui Hu & Qing Wang, 2011. "Closedness of a Convex Cone and Application by Means of the End Set of a Convex Set," Journal of Optimization Theory and Applications, Springer, vol. 150(1), pages 52-64, July.
    3. Edward J. Anderson & Miguel A. Goberna & Marco A. López, 2001. "Simplex-Like Trajectories on Quasi-Polyhedral Sets," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 147-162, February.
    4. Hui Hu, 2005. "Characterizations of the Strong Basic Constraint Qualifications," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 956-965, November.
    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. X. Yang & K. Meng, 2014. "Comments on: Farkas’ Lemma: three decades of generalizations for mathematical optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 38-40, April.
    2. Hui Hu & Qing Wang, 2011. "Closedness of a Convex Cone and Application by Means of the End Set of a Convex Set," Journal of Optimization Theory and Applications, Springer, vol. 150(1), pages 52-64, July.
    3. Hui Hu & Qing Wang, 2011. "Closedness of a Convex Cone and Application by Means of the End Set of a Convex Set," Journal of Optimization Theory and Applications, Springer, vol. 151(3), pages 633-645, December.
    4. M. A. Goberna & M. A. López, 2018. "Recent contributions to linear semi-infinite optimization: an update," Annals of Operations Research, Springer, vol. 271(1), pages 237-278, December.
    5. Goberna, M. A. & Lopez, M. A., 2002. "Linear semi-infinite programming theory: An updated survey," European Journal of Operational Research, Elsevier, vol. 143(2), pages 390-405, December.
    6. Vo Si Trong Long, 2024. "On Global Error Bounds for Convex Inequalities Systems," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1359-1384, September.
    7. Archis Ghate & Dushyant Sharma & Robert L. Smith, 2010. "A Shadow Simplex Method for Infinite Linear Programs," Operations Research, INFORMS, vol. 58(4-part-1), pages 865-877, August.
    8. Zhou Wei & Jen-Chih Yao, 2018. "On Several Types of Basic Constraint Qualifications via Coderivatives for Generalized Equations," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 106-126, April.
    9. M. A. Goberna & M. A. López, 2017. "Recent contributions to linear semi-infinite optimization," 4OR, Springer, vol. 15(3), pages 221-264, September.

    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:164:y:2015:i:1:d:10.1007_s10957-014-0582-y. 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.