The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications

Defeng Sun

doi:10.1287/moor.1060.0195

The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications

Defeng Sun

Research output: Journal article publication › Journal article › Academic research › peer-review

106 Citations (Scopus)

Abstract

For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equivalent: the strong second-order sufficient condition and constraint nondegeneracy; the nonsingularity of Clarke's Jacobian of the Karush-Kuhn-Tucker system; the strong regularity of the Karush-Kuhn-Tucker point; and others. © 2006 INFORMS.

Original language	English
Pages (from-to)	761-776
Number of pages	16
Journal	Mathematics of Operations Research
Volume	31
Issue number	4
DOIs	https://doi.org/10.1287/moor.1060.0195
Publication status	Published - 1 Nov 2006
Externally published	Yes

Keywords

Constraint nondegeneracy
Nonlinear semidefinite programming
Strong regularity
Strong second-order sufficient condition

ASJC Scopus subject areas

Mathematics(all)
Computer Science Applications
Management Science and Operations Research

More information

10.1287/moor.1060.0195

Scopus Link

Cite this

@article{a68f73d4c62749ddb0f3b0227bb02e3c,

title = "The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications",

abstract = "For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equivalent: the strong second-order sufficient condition and constraint nondegeneracy; the nonsingularity of Clarke's Jacobian of the Karush-Kuhn-Tucker system; the strong regularity of the Karush-Kuhn-Tucker point; and others. {\textcopyright} 2006 INFORMS.",

keywords = "Constraint nondegeneracy, Nonlinear semidefinite programming, Strong regularity, Strong second-order sufficient condition",

author = "Defeng Sun",

year = "2006",

month = nov,

day = "1",

doi = "10.1287/moor.1060.0195",

language = "English",

volume = "31",

pages = "761--776",

journal = "Mathematics of Operations Research",

issn = "0364-765X",

publisher = "INFORMS Institute for Operations Research and the Management Sciences",

number = "4",

}

TY - JOUR

T1 - The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications

AU - Sun, Defeng

PY - 2006/11/1

Y1 - 2006/11/1

N2 - For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equivalent: the strong second-order sufficient condition and constraint nondegeneracy; the nonsingularity of Clarke's Jacobian of the Karush-Kuhn-Tucker system; the strong regularity of the Karush-Kuhn-Tucker point; and others. © 2006 INFORMS.

AB - For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equivalent: the strong second-order sufficient condition and constraint nondegeneracy; the nonsingularity of Clarke's Jacobian of the Karush-Kuhn-Tucker system; the strong regularity of the Karush-Kuhn-Tucker point; and others. © 2006 INFORMS.

KW - Constraint nondegeneracy

KW - Nonlinear semidefinite programming

KW - Strong regularity

KW - Strong second-order sufficient condition

UR - http://www.scopus.com/inward/record.url?scp=33746089809&partnerID=8YFLogxK

U2 - 10.1287/moor.1060.0195

DO - 10.1287/moor.1060.0195

M3 - Journal article

VL - 31

SP - 761

EP - 776

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

SN - 0364-765X

IS - 4

ER -