Primal-dual active-set methods for large-scale optimization (Q493264)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6478111
Language Label Description Also known as
default for all languages
No label defined
    English
    Primal-dual active-set methods for large-scale optimization
    scientific article; zbMATH DE number 6478111

      Statements

      Primal-dual active-set methods for large-scale optimization (English)
      0 references
      0 references
      3 September 2015
      0 references
      The author considers the nearest low-rank correlation matrix problem: \(\underset{M \i S^n} \min\frac12 \| M -C \|{}^2_F\) subject to \(\text{diag}(M)=e\), \(M\geq 0\), \(\text{rank}(M)\leq p\). This problem plays an important role in mathematical finance. The author presents a new easily computed constraint-preserving update scheme, which can be viewed as a generalization of the Cayley transform, a classical retraction on the Stiefel manifold.
      0 references
      0 references
      constrained optimization
      0 references
      primal-dual active-set methods
      0 references
      augmented Lagrangian
      0 references
      large-scale optimization
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references