A Jordan-algebraic approach to potential-reduction algorithms

By L. Faybusovich. 2002

105 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/6bda6c2be0c4fbec0809d4728a3a1ddd1877da7b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Manuel V. C. Vieira
2. Henry Wolkowicz
3. Jos F. Sturm
4. Lieven Vandenberghe
5. Romesh Saigal
6. Francis R. Bach
7. Stephen P. Boyd
8. Rui Zhang

In Numerical Analysis

1. Manuel V. C. Vieira
2. Henry Wolkowicz
3. Jos F. Sturm
4. Lieven Vandenberghe
5. Romesh Saigal
6. Stephen P. Boyd
7. Francis R. Bach
8. Rui Zhang

Citations in the corpus

• Similarity and other spectral relations for symmetric cones (2000, background): “Remark though, that explicit forms have already been derived by various researchers, see [10, 21, 22, 23, 26], and it has been implemented in SeDuMi [20].”
• Handbook of Semidefinite Programming (2000, methodology): “We should mention that Faybusovich in [235] also studies the potential functions for symmetric cones, but they are employed in primal-dual algorithms and may be viewed as generalizations of the subject matter of the next chapter.”
• Jordan algebraic approach to symmetric optimization (2007, methodology): “The point w in the previous proposition is known as the scaling point corresponding to x and s (see [16]), i.”
• Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (2007, unknown): “This is how Faybusovich could extend potential-reduction algorithms [9].”