Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming

2008 ◽  
Vol 19 (1) ◽  
pp. 370-396 ◽  
Author(s):  
Zi Xian Chan ◽  
Defeng Sun
Keyword(s):  
Semidefinite Programming ◽  
Strong Regularity ◽  
Constraint Nondegeneracy

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

2013 ◽  
Vol 2013 ◽  
pp. 1-21 ◽  
Author(s):  
Shaohua Pan ◽  
Shujun Bi ◽  
Jein-Shan Chen
Keyword(s):  
Constraint Qualification ◽  
Optimal Solution ◽  
Second Order ◽  
Strong Regularity ◽  
Cone Programming ◽  
Second Order Cone Programming ◽  
Second Order Cone ◽  
Constraint Nondegeneracy ◽  
Robinson’S Constraint Qualification ◽  
Locally Optimal Solution

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.

scholarly journals Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares

2021 ◽  
Vol 107 ◽  
pp. 67-105
Author(s):  
Elisabeth Gaar ◽  
Daniel Krenn ◽  
Susan Margulies ◽  
Angelika Wiegele
Keyword(s):  
Semidefinite Programming ◽  
Sums Of Squares
Sign in / Sign up

Export Citation Format

Share Document