Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Klerk de E. — Aspects of Semidefinite Programming
Klerk de E. — Aspects of Semidefinite Programming



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Aspects of Semidefinite Programming

Автор: Klerk de E.

Аннотация:

This monograph has grown from my PhD thesis Interior point Methods for Semidefinite Programming [39] which was published in December 1997. Since that time, Semidefinite Programming (SDP) has remained a popular research topic and the associated body of literature has grown considerably. As SDP has proved such a useful tool in many applications, like systems and control theory and combinatorial optimization, there is a growing number of people who would like to learn more about this field.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2002

Количество страниц: 283

Добавлена в каталог: 26.06.2009

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Semidefinite programming      1
Semidefinite programming, applications in approximation theory      8
Semidefinite programming, applications in combinatorial optimization      4
Semidefinite programming, applications in engineering      10
Semidefinite programming, interior point algorithms for      11
Semidefinite programming, review papers on      18
Semidefinite programming, special cases of      3
Separation theorem for convex sets      26 151 239
Sequential minimization methods      12
Shannon capacity      165
Shor relaxation      215
Simple graph      169
Skew-symmetric matrix      105
Slater regularity      23 241
smat      249
Solvability      22
sp      146
Sparsity      101
Spectral bundle method      17
Spectral decomposition      48
Spectral decomposition of optimal solutions      35
Spectral norm      232 xvi
Spectral radius      143 232 xvi
Spherical simplex      178
Spherical tetrahedron      227 228
Spherical triangle      226
Spherical triangle, angular excess of      226
Spherical triangle, area of      226
Stability number      187
Stable set      7 188 213
Stable set polytope      8
Standard quadratic optimization      204
Standard quadratic optimization, copositive programming formulation of      205
Standard quadratic optimization, LP approximation of      205
Standard quadratic optimization, naive approximation of      205
Standard quadratic optimization, SDP approximation of      207
Step length      24
Strict complementarity      33 34 38 128
Strict feasibility      23
Strictly convex function      237
Strictly convex function, characterization of      238
Strictly convex function, minimizers of      238
Strong duality      3 25 242
Strong feasibility      23
Strong infeasibility, characterization of      29
Strong product for graphs      164
Structural design      11
Sum of squares      10
Superlinear convergence      15 128
svec      249
Symmetric Kronecker product      251
Symmetric Kronecker product, properties of      252
Symmetric square root factorization      230
Symmetrization strategy      14
System and control theory      10 133
t      50
Tanabe-Todd-Ye potential function $(\Phi)$      16 134 137
Taylor expansion      247
Trace      2 44 99 232
Trace, properties of      232
Traveling salesman problem      8
Triangle inequalities      215
Triangle-free graph      203
Truss      11
Truth assignment      211 224
Turing machine      17
Unboundedness      22
Unit hypersphere      178 227
Weak duality      2 241
Weak infeasibility      29
Weak infeasibility, characterization of      31
Weakly improving ray      31 32
Weight of a cut      5 169
Worst-case iteration bound      12
Worst-case iteration bound, Dikin-type algorithm      108
Worst-case iteration bound, dual scaling method      92
Worst-case iteration bound, long step dual log-barrier method      92
Worst-case iteration bound, Mizuno — Todd — Ye predictor-corrector algorithm      128
Worst-case iteration bound, NT potential reduction method      146
Worst-case iteration bound, primal-dual affine—scaling algorithm      112
Worst-case iteration bound, primal-dual path-following algorithm with full NT steps      124
Worst-case iteration bound, short step primal log-barrier method      88
ZPP      158
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте