IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v66y2016i3d10.1007_s10898-016-0410-z.html
   My bibliography  Save this article

Sufficient conditions for error bounds of difference functions and applications

Author

Listed:
  • Nguyen Thi Hang

    (Vietnam Academy of Science and Technology)

  • Jen-Chih Yao

    (China Medical University)

Abstract

This paper establishes verifiable sufficient conditions for the existence of error bounds for the sub-level set of a difference function over an abstract constraint by applying a technique used by A. D. Ioffe. As a consequence, error bounds for constraint systems defined by d.c. inequalities and their applications in studying of exactness of the associated $$\ell _1$$ ℓ 1 penalty function and existence of Lagrange multipliers as necessary optimality conditions are also investigated.

Suggested Citation

  • Nguyen Thi Hang & Jen-Chih Yao, 2016. "Sufficient conditions for error bounds of difference functions and applications," Journal of Global Optimization, Springer, vol. 66(3), pages 439-456, November.
    • Handle: RePEc:spr:jglopt:v:66:y:2016:i:3:d:10.1007_s10898-016-0410-z
    DOI: 10.1007/s10898-016-0410-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0410-z
    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/s10898-016-0410-z?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. Hoai Le Thi & Tao Pham Dinh & Huynh Ngai, 2012. "Exact penalty and error bounds in DC programming," Journal of Global Optimization, Springer, vol. 52(3), pages 509-535, March.
    2. A. A. Auslender & J.-P. Crouzeix, 1988. "Global Regularity Theorems," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 243-253, May.
    3. Frank H. Clarke, 1976. "A New Approach to Lagrange Multipliers," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 165-174, May.
    4. O. L. Mangasarian, 1985. "A Condition Number for Differentiable Convex Inequalities," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 175-179, May.
    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. K.F. Ng & X.Y. Zheng, 2003. "Error Bounds of Constrained Quadratic Functions and Piecewise Affine Inequality Systems," Journal of Optimization Theory and Applications, Springer, vol. 118(3), pages 601-618, September.
    2. Enrico Bellino, 2010. "Comment To ‘Commodity Content . . .’ By Fujimoto And Opocher," Metroeconomica, Wiley Blackwell, vol. 61(4), pages 749-753, November.
    3. Kuang Bai & Yixia Song & Jin Zhang, 2023. "Second-Order Enhanced Optimality Conditions and Constraint Qualifications," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1264-1284, September.
    4. Y. Y. Zhou & X. Q. Yang, 2009. "Duality and Penalization in Optimization via an Augmented Lagrangian Function with Applications," Journal of Optimization Theory and Applications, Springer, vol. 140(1), pages 171-188, January.
    5. Florian Scheuer & Alexander Wolitzky, 2016. "Capital Taxation under Political Constraints," American Economic Review, American Economic Association, vol. 106(8), pages 2304-2328, August.
    6. Welington Oliveira, 2019. "Proximal bundle methods for nonsmooth DC programming," Journal of Global Optimization, Springer, vol. 75(2), pages 523-563, October.
    7. Abhishek Singh & Debdas Ghosh & Qamrul Hasan Ansari, 2024. "Inexact Newton Method for Solving Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 201(3), pages 1333-1363, June.
    8. Casey Rothschild & Florian Scheuer, 2016. "Optimal Taxation with Rent-Seeking," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 83(3), pages 1225-1262.
    9. Hoai An Le Thi & Manh Cuong Nguyen, 2017. "DCA based algorithms for feature selection in multi-class support vector machine," Annals of Operations Research, Springer, vol. 249(1), pages 273-300, February.
    10. Yuntong Wang, 2014. "Envelope Theorem without Differentiability," Working Papers 1404, University of Windsor, Department of Economics.
    11. Hoai An Thi & Thi Minh Tam Nguyen & Tao Pham Dinh, 2023. "On solving difference of convex functions programs with linear complementarity constraints," Computational Optimization and Applications, Springer, vol. 86(1), pages 163-197, September.
    12. M. V. Dolgopolik, 2020. "New global optimality conditions for nonsmooth DC optimization problems," Journal of Global Optimization, Springer, vol. 76(1), pages 25-55, January.
    13. Xi Yin Zheng & Kung Fu Ng, 2004. "Error Bound Moduli for Conic Convex Systems on Banach Spaces," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 213-228, May.
    14. Zachary Bethune & Tai-Wei Hu & Guillaume Rocheteau, 2018. "Optimal Credit Cycles," Review of Economic Dynamics, Elsevier for the Society for Economic Dynamics, vol. 27, pages 231-245, January.
    15. Ewald, Christian Oliver & Nolan, Charles, 2024. "On the adaptation of the Lagrange formalism to continuous time stochastic optimal control: A Lagrange-Chow redux," Journal of Economic Dynamics and Control, Elsevier, vol. 162(C).
    16. A. M. Bagirov & N. Hoseini Monjezi & S. Taheri, 2021. "An augmented subgradient method for minimizing nonsmooth DC functions," Computational Optimization and Applications, Springer, vol. 80(2), pages 411-438, November.
    17. Wu Li & Ivan Singer, 1998. "Global Error Bounds for Convex Multifunctions and Applications," Mathematics of Operations Research, INFORMS, vol. 23(2), pages 443-462, May.
    18. Elodie Adida & Georgia Perakis, 2007. "A nonlinear continuous time optimal control model of dynamic pricing and inventory control with no backorders," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(7), pages 767-795, October.
    19. Holger Scheel & Stefan Scholtes, 2000. "Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 1-22, February.
    20. Casey Rothschild & Florian Scheuer, 2014. "A Theory of Income Taxation under Multidimensional Skill Heterogeneity," NBER Working Papers 19822, National Bureau of Economic Research, Inc.

    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:jglopt:v:66:y:2016:i:3:d:10.1007_s10898-016-0410-z. 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.