IDEAS home Printed from https://ideas.repec.org/a/hin/jnlaaa/602735.html

Nonsingularity Conditions for FB System of Reformulating Nonlinear Second-Order Cone Programming

Author

Listed:
  • Shaohua Pan
  • Shujun Bi
  • Jein-Shan Chen

Abstract

This paper is a counterpart of Bi et al., 2011. For a locally optimal solution to the nonlinear second-order cone programming (SOCP), specifically, under Robinson’s constraint qualification, we establish the equivalence among the following three conditions: the nonsingularity of Clarke’s Jacobian of Fischer-Burmeister (FB) nonsmooth system for the Karush-Kuhn-Tucker conditions, the strong second-order sufficient condition and constraint nondegeneracy, and the strong regularity of the Karush-Kuhn-Tucker point.

Suggested Citation

  • Shaohua Pan & Shujun Bi & Jein-Shan Chen, 2013. "Nonsingularity Conditions for FB System of Reformulating Nonlinear Second-Order Cone Programming," Abstract and Applied Analysis, Hindawi, vol. 2013, pages 1-21, March.
    • Handle: RePEc:hin:jnlaaa:602735
    DOI: 10.1155/2013/602735
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AAA/2013/602735.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/AAA/2013/602735.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/602735?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
    ---><---

    Citations

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


    Cited by:

    1. Xiaoni Chi & Zhongping Wan & Zijun Hao, 2013. "The Jacobian Consistency of a One‐Parametric Class of Smoothing Functions for SOCCP," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).
    2. Kuo-Yang Wu & Sendren Sheng-Dong Xu & Tzong-Chen Wu, 2013. "Optimal Scheduling for Retrieval Jobs in Double‐Deep AS/RS by Evolutionary Algorithms," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlaaa:602735. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.