𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence of a Dual-Variable Vector Sequence in a Semi-Definite Programming Problem

✍ Scribed by I. I. Dikin

Book ID
111544781
Publisher
Springer US
Year
2003
Tongue
English
Weight
40 KB
Volume
39
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A case of non-convergent dual changes in
A case of non-convergent dual changes in assignment problems
✍ JuliΓ‘n ArΓ‘oz; Jack Edmonds πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 325 KB

We give an example of iterative dual changes i n Assignment Problems which does not converge to the solution. To built up the example we use properties of the Fibonacci Sequence. .