9786131158179 (4 résultats)
Edité par Omniscriptum Mär 2026, 2026
- Couverture souple
- impression à la demande
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AllemagneBuchWeltWeit Ludwig Meier e.K.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 39,00
EUR 23,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersec…tion of the cone of positive semidefinite matrices with an affine space. Semidefinite programming is a relatively new field of optimization which is of growing interest for several reasons. Many practical problems in operations research and combinatorial optimization can be modeled or approximated as semidefinite programming problems. In automatic control theory, SDP's are used in the context of linear matrix inequalities. SDPs are in fact a special case of cone programming and can be efficiently solved by interior point methods. 124 pp. Englisch.
Edité par Omniscriptum
- Couverture souple
- impression à la demande
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 41,93
EUR 30,50 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection…of the cone of positive semidefinite matrices with an affine space. Semidefinite programming is a relatively new field of optimization which is of growing interest for several reasons. Many practical problems in operations research and combinatorial optimization can be modeled or approximated as semidefinite programming problems. In automatic control theory, SDP's are used in the context of linear matrix inequalities. SDPs are in fact a special case of cone programming and can be efficiently solved by interior point methods.
Edité par OmniScriptum, 2026
- Couverture souple
- impression à la demande
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 125,30
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Taschenbuch. Etat : Neu. Semidefinite Programming | Convex Optimization, Matrix, Affine Space, Operations Research, Combinatorial Optimization, Linear Matrix Inequality, Conic Optimization | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131158179 | Verantwortliche Person für die EU: preigu G…mbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
Edité par Omniscriptum Mär 2026, 2026
- Couverture souple
- impression à la demande
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 156,00
EUR 60,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. Semidefiniteprogramming (SDP) is a subfield of convex optimization concerned withthe optimization of a linear obj…ective function over the intersection ofthe cone of positive semidefinite matrices with an affine space.Semidefinite programming is a relatively new field of optimization whichis of growing interest for several reasons. Many practical problems inoperations research and combinatorial optimization can be modeled orapproximated as semidefinite programming problems. In automatic controltheory, SDP's are used in the context of linear matrix inequalities.SDPs are in fact a special case of cone programming and can beefficiently solved by interior point methods.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 124 pp. Englisch.
