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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Boyd, P. Diaconis, and L. Xiao, Fasted mixing Markov chain on a graph, SIAM Review, 46(4) (2004), 667–689.
S. Boyd, P. Diaconis, P. A. Parrilo et al., Fasted mixing Markov chain on graphs with symmetries, SIAM J. Optimiz., 20(2) (2009), 792–891.
D. F. Sun, The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications, Math Oper Res., 31(4) (2006), 761–776.
M. T. Chu, R. E. Funderlic, and R. J. Plemmons, Structured low rank approximation, Linear Algebar Appl., 336 (2003), 157–172.
B. Wu, C. Ding, and D. F. Sun et al., On the Moreau-Yoshida regularization of the vector k-norm related functions, SIAMJ. Optimiz., 24(2) (2014), 766–794.
R. Helgason, J. Kennington, and H. Lall, A polynomially bounded algorithm for a singly constrained quadratic program, Math Program., 18(1) (1980), 338–343.
P. H. Calamai and J. J. More, Quasi-Newton updates with bounds, SIAM J. Numer Anal., 24(6) (1987), 1434–1441.
N. Maculan, C. P. Santiago, and Macambira et al., An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box, J Optimiz Theorey App., 117(3) (2003), 553–574.
Y. J. Liu, S. Y. Wang, and J. H. Sun, Finding the projection onto the intersection of a closed half-space and a variable box, Oper. Res. Lett., 41(3) (2013), 259–264.
F. H. Clarke, Optimization and Nonsmooth Analysis, New York: John Wiley and Sons; 1990. Chapter 2, Generalized Gradients, p.50–62.
Acknowledgement
This work is supported by the National Natural Science Foundation of China (Grant No. 11701390).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, S. The Geometric Properties of a Class of Nonsymmetric Cones. Indian J Pure Appl Math 51, 989–1002 (2020). https://doi.org/10.1007/s13226-020-0445-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13226-020-0445-1