Convex optimization has witnessed a considerable progress, mainly due to the development of powerful algorithms and software. In fact, one class of convex problems, called self-scaled, can be particularly efficiently solved. This class encompasses a large amount of real-life convex optimization problems, including linear and semidefinite programming. This class is best described using an algebraic structure known as formally real (or Euclidean) Jordan algebra, which provides an elegant and powerful unifying framework for its study. This book proposes an extensive and self-contained description of these algebras. Our work focuses on the so-called spectral functions on formally real Jordan algebras, a natural generalization of spectral functions of symmetric matrices. Based on an original variational analysis of eigenvalues in Jordan algebras, we discuss their most important properties, such as differentiability and convexity. We show how these results can be applied to extend several algorithms existing for linear or second-order programming to the general class of self-scaled problems, e.g. the powerful smoothing techniques of Nesterov.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Convex optimization has witnessed a considerable progress, mainly due to the development of powerful algorithms and software. In fact, one class of convex problems, called self-scaled, can be particularly efficiently solved. This class encompasses a large amount of real-life convex optimization problems, including linear and semidefinite programming. This class is best described using an algebraic structure known as formally real (or Euclidean) Jordan algebra, which provides an elegant and powerful unifying framework for its study. This book proposes an extensive and self-contained description of these algebras. Our work focuses on the so-called spectral functions on formally real Jordan algebras, a natural generalization of spectral functions of symmetric matrices. Based on an original variational analysis of eigenvalues in Jordan algebras, we discuss their most important properties, such as differentiability and convexity. We show how these results can be applied to extend several algorithms existing for linear or second-order programming to the general class of self-scaled problems, e.g. the powerful smoothing techniques of Nesterov.
Michel Baes completed his Ph.D. in 2006 at the Center for Operations Research and Econometrics (CORE) in Louvain-la- Neuve under supervision of Pr. Yurii Nesterov. After a Postdoctoral stay at the K.U.Leuven?s Optimization in Engineering Center (OPTEC), he is working now as a senior scientific researcher at ETH in Zurich.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Convex optimization has witnessed a considerable progress, mainly due to the development of powerful algorithms and software. In fact, one class of convex problems, called self-scaled, can be particularly efficiently solved. This class encompasses a large amount of real-life convex optimization problems, including linear and semidefinite programming. This class is best described using an algebraic structure known as formally real (or Euclidean) Jordan algebra, which provides an elegant and powerful unifying framework for its study. This book proposes an extensive and self-contained description of these algebras. Our work focuses on the so-called spectral functions on formally real Jordan algebras, a natural generalization of spectral functions of symmetric matrices. Based on an original variational analysis of eigenvalues in Jordan algebras, we discuss their most important properties, such as differentiability and convexity. We show how these results can be applied to extend several algorithms existing for linear or second-order programming to the general class of self-scaled problems, e.g. the powerful smoothing techniques of Nesterov. 268 pp. Englisch. N° de réf. du vendeur 9783838312101
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. N° de réf. du vendeur 5411910
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Convex optimization has witnessed a considerable progress, mainly due to the development of powerful algorithms and software. In fact, one class of convex problems, called self-scaled, can be particularly efficiently solved. This class encompasses a large amount of real-life convex optimization problems, including linear and semidefinite programming. This class is best described using an algebraic structure known as formally real (or Euclidean) Jordan algebra, which provides an elegant and powerful unifying framework for its study. This book proposes an extensive and self-contained description of these algebras. Our work focuses on the so-called spectral functions on formally real Jordan algebras, a natural generalization of spectral functions of symmetric matrices. Based on an original variational analysis of eigenvalues in Jordan algebras, we discuss their most important properties, such as differentiability and convexity. We show how these results can be applied to extend several algorithms existing for linear or second-order programming to the general class of self-scaled problems, e.g. the powerful smoothing techniques of Nesterov.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 268 pp. Englisch. N° de réf. du vendeur 9783838312101
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Convex optimization has witnessed a considerable progress, mainly due to the development of powerful algorithms and software. In fact, one class of convex problems, called self-scaled, can be particularly efficiently solved. This class encompasses a large amount of real-life convex optimization problems, including linear and semidefinite programming. This class is best described using an algebraic structure known as formally real (or Euclidean) Jordan algebra, which provides an elegant and powerful unifying framework for its study. This book proposes an extensive and self-contained description of these algebras. Our work focuses on the so-called spectral functions on formally real Jordan algebras, a natural generalization of spectral functions of symmetric matrices. Based on an original variational analysis of eigenvalues in Jordan algebras, we discuss their most important properties, such as differentiability and convexity. We show how these results can be applied to extend several algorithms existing for linear or second-order programming to the general class of self-scaled problems, e.g. the powerful smoothing techniques of Nesterov. N° de réf. du vendeur 9783838312101
Quantité disponible : 1 disponible(s)