IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v51y2020i3d10.1007_s13226-020-0445-1.html
   My bibliography  Save this article

The Geometric Properties of a Class of Nonsymmetric Cones

Author

Listed:
  • Shiyun Wang

    (Shenyang Institute of Aeronautical Engineering)

Abstract

Geometric methods are important for researching the differential properties of metric projectors, sensitivity analysis, and the augmented Lagrangian algorithm. Sun [3] researched the relationship among the strong second-order sufficient condition, constraint nondegeneracy, B-subdifferential nonsingularity of the KKT system, and the strong regularity of KKT points in investigating nonlinear semidefinite programming problems. Geometric properties of cones are necessary in studying second-order sufficient condition and constraint nondegeneracy. In this paper, we study the geometric properties of a class of nonsymmetric cones, which is widely applied in optimization problems subjected to the epigraph of vector k-norm functions and low-rank-matrix approximations. We compute the polar, the tangent cone, the linear space of the tangent cone, the critical cone, and the affine hull of this critical cone. This paper will support future research into the sensitivity and algorithms of related optimization problems.

Suggested Citation

  • Shiyun Wang, 2020. "The Geometric Properties of a Class of Nonsymmetric Cones," Indian Journal of Pure and Applied Mathematics, Springer, vol. 51(3), pages 989-1002, September.
    • Handle: RePEc:spr:indpam:v:51:y:2020:i:3:d:10.1007_s13226-020-0445-1
    DOI: 10.1007/s13226-020-0445-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-020-0445-1
    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/s13226-020-0445-1?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. N. Maculan & C.P. Santiago & E.M. Macambira & M.H.C. Jardim, 2003. "An O(n) Algorithm for Projecting a Vector on the Intersection of a Hyperplane and a Box in Rn," Journal of Optimization Theory and Applications, Springer, vol. 117(3), pages 553-574, June.
    2. Defeng Sun, 2006. "The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 761-776, 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. H. Luo & H. Wu & G. Chen, 2012. "On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming," Journal of Global Optimization, Springer, vol. 54(3), pages 599-618, November.
    2. Liwei Zhang & Shengzhe Gao & Saoyan Guo, 2019. "Statistical Inference of Second-Order Cone Programming," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(02), pages 1-17, April.
    3. Wenyu Sun & Chengjin Li & Raimundo Sampaio, 2011. "On duality theory for non-convex semidefinite programming," Annals of Operations Research, Springer, vol. 186(1), pages 331-343, June.
    4. Shun Arahata & Takayuki Okuno & Akiko Takeda, 2023. "Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems," Computational Optimization and Applications, Springer, vol. 86(2), pages 555-598, November.
    5. Lingchen Kong & Levent Tunçel & Naihua Xiu, 2011. "Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 148(2), pages 364-389, February.
    6. Qi Zhao & Zhongwen Chen, 2018. "An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(03), pages 1-25, June.
    7. Yong-Jin Liu & Li Wang, 2016. "Properties associated with the epigraph of the $$l_1$$ l 1 norm function of projection onto the nonnegative orthant," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 205-221, August.
    8. Hezhi Luo & Huixian Wu & Jianzhen Liu, 2015. "On Saddle Points in Semidefinite Optimization via Separation Scheme," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 113-150, April.
    9. B. S. Mordukhovich & T. T. A. Nghia & R. T. Rockafellar, 2015. "Full Stability in Finite-Dimensional Optimization," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 226-252, February.
    10. K. C. Kiwiel, 2007. "On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem," Journal of Optimization Theory and Applications, Springer, vol. 134(3), pages 549-554, September.
    11. Le Thi, Hoai An & Ta, Anh Son & Pham Dinh, Tao, 2018. "An efficient DCA based algorithm for power control in large scale wireless networks," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 215-226.
    12. Chengjin Li, 2014. "A New Approximation of the Matrix Rank Function and Its Application to Matrix Rank Minimization," Journal of Optimization Theory and Applications, Springer, vol. 163(2), pages 569-594, November.
    13. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    14. Chengjing Wang, 2016. "On how to solve large-scale log-determinant optimization problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 489-511, June.
    15. Jérôme Bolte & Aris Daniilidis & Adrian S. Lewis, 2011. "Generic Optimality Conditions for Semialgebraic Convex Programs," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 55-70, February.
    16. Qingna Li & Donghui Li & Houduo Qi, 2010. "Newton’s Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound," Journal of Optimization Theory and Applications, Springer, vol. 147(3), pages 546-568, December.
    17. Huixian Wu & Hezhi Luo & Xiaodong Ding & Guanting Chen, 2013. "Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming," Computational Optimization and Applications, Springer, vol. 56(3), pages 531-558, December.
    18. Houduo Qi, 2009. "Local Duality of Nonlinear Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 124-141, February.
    19. H. Wu & H. Luo & J. Yang, 2014. "Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming," Journal of Global Optimization, Springer, vol. 59(4), pages 695-727, August.
    20. Aviad Aberdam & Amir Beck, 2022. "An Accelerated Coordinate Gradient Descent Algorithm for Non-separable Composite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 219-246, June.

    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:indpam:v:51:y:2020:i:3:d:10.1007_s13226-020-0445-1. 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.