Sciweavers

3 search results - page 1 / 1
» A Regularized Smoothing Newton Method for Symmetric Cone Com...
Sort
View
SIAMJO
2008
109views more  SIAMJO 2008»
13 years 4 months ago
A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear ...
Lingchen Kong, Jie Sun, Naihua Xiu
SIAMJO
2008
141views more  SIAMJO 2008»
13 years 4 months ago
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
Zi Xian Chan, Defeng Sun
SIAMJO
2002
149views more  SIAMJO 2002»
13 years 4 months ago
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...
Christian Kanzow, Christian Nagel