9786131158179 (4 Ergebnisse)
Verlag: Omniscriptum Mär 2026 2026
- Softcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 39,00
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: 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 inters…ection 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.
Verlag: Omniscriptum
- Softcover
- Print-on-Demand
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 40,58
EUR 61,02 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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 intersectio…n 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.
Verlag: OmniScriptum 2026
- Softcover
- Print-on-Demand
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 125,30
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: 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… GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
Verlag: Omniscriptum Mär 2026 2026
- Softcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 156,00
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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 o…bjective 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.
