✦ LIBER ✦

Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity

✍ Scribed by Kanzow, Christian; Nagel, Christian

Book ID: 118204271
Publisher: Society for Industrial and Applied Mathematics
Year: 2005
Tongue: English
Weight: 205 KB
Volume: 15
Category: Article
ISSN: 1052-6234
DOI: 10.1137/s1052623403431147

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quadratic convergence of a smoothing New

Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity

✍ Kong, Lingchen 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 324 KB

Superlinear and quadratic convergence of

Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption

✍ Matthias Heinkenschloss; Michael Ulbrich; Stefan Ulbrich 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 163 KB

Superlinear convergence of affine scalin

Superlinear convergence of affine scaling interior point newton method for linear inequality constrained minimization without strict complementarity

✍ De-tong Zhu 📂 Article 📅 2009 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 231 KB

Technical Note: Some Structural Properti

Technical Note: Some Structural Properties of a Newton-Type Method for Semidefinite Programs

✍ C. Kanzow; C. Nagel 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 78 KB

Sub-quadratic convergence of a smoothing

Sub-quadratic convergence of a smoothing Newton method for second-order cone programming

✍ Xiaoni Chi; Sanyang Liu 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 322 KB

A smoothing Newton method for a type of

A smoothing Newton method for a type of inverse semi-definite quadratic programming problem

✍ Xiantao Xiao; Liwei Zhang; Jianzhong Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 629 KB

We consider an inverse problem arising from the semi-definite quadratic programming (SDQP) problem. We represent this problem as a cone-constrained minimization problem and its dual (denoted ISDQD) is a semismoothly differentiable (SC 1 ) convex programming problem with fewer variables than the orig