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

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

Renegar J. — A mathematical view of interior-point methods in convex optimization
Renegar J. — A mathematical view of interior-point methods in convex optimization

Читать книгу

Скачать книгу с нашего сайта нельзя

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

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

Название: A mathematical view of interior-point methods in convex optimization

Автор: Renegar J.


This compact book, through the simplifying perspective it presents, will take a reader who knows little of interior-point methods to within sight of the research frontier, developing key ideas that were over a decade in the making by numerous interior-point method researchers. It aims at developing a thorough understanding of the most general theory for interior-point methods, a class of algorithms for convex optimization problems. The study of these algorithms has dominated the continuous optimization literature for nearly 15 years. In that time, the theory has matured tremendously, but much of the literature is difficult to understand, even for specialists. By focusing only on essential elements of the theory and emphasizing the underlying geometry, A Mathematical View of Interior-Point Methods in Convex Optimization makes the theory accessible to a wide audience, allowing them to quickly develop a fundamental understanding of the material.

The author begins with a general presentation of material pertinent to continuous optimization theory, phrased so as to be readily applicable in developing interior-point method theory. This presentation is written in such a way that even motivated Ph.D. students who have never had a course on continuous optimization can gain sufficient intuition to fully understand the deeper theory that follows. Renegar continues by developing the basic interior-point method theory, with emphasis on motivation and intuition. In the final chapter, he focuses on the relations between interior-point methods and duality theory, including a self-contained introduction to classical duality theory for conic programming; an exploration of symmetric cones; and the development of the general theory of primal-dual algorithms for solving conic programming optimization problems.

Rather than attempting to be encyclopedic, A Mathematical View of Interior-Point Methods in Convex Optimization gives the reader a solid understanding of the core concepts and relations, the kind of understanding that stays with a reader long after the book is finished.

Язык: en

Рубрика: Математика/

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

ed2k: ed2k stats

Издание: 1st

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
Предметный указатель
$A^{*}_{x}$      22
$B_{x}(y,r)$      23
$g_{x}(y)$      22
$g|_{L,x}(y)$      22
$H_{x}(y)$      22
$H|_{L,x}(y)$      22
$H|_{L}(x)$      11
$K^{*}_{z}$      83
$P_{L,x}$      22
$P_{L}$      8
$q_{x}(y)$      18
$v_{f}$      35
$X1 \circ X2$      2
$x_{1} \cdot x_{2}$      2
$\langle$ , $\rangle$      2
$\langle$ , $\rangle_{S}$      5
$\langle$ , $\rangle_{x}$      22
$\mathbf{R}^{n}_{++}$      24
$\mathbf{S}^{n \times n}$      2
$\mathbf{S}^{n \times n}_{++}$      6
$\mathcal{C}^{1}$      6
$\mathcal{C}^{2}$      9
$\mathcal{SCB}$      35
$\mathcal{SC}$      23
$||$ $||$      2
$||$ $||_{S}$      5
$||$ $||_{x}$      22
$||A||$      4
a-val      71
a-val*      73
Analytic center      39
Asymptotic feasibility      71
Asymptotic optimal value      71
Barrier functional      35
Central path      43
Complexity value      35
Conjugate functional      76
Dual cone      65
F*      76
Frobenius norm      2
G(x)      6
Gradient      6
H(X)      9
hessian      9
Intrinsically self-conjugate      83
Intrinsically self-dual      83
K*      65
Logarithmic homogeneity      42
N(X)      19
Nesterov — Todd directions      98 99
Positive definite (pd)      4
Positive semidefinite (psd)      4
Scaling point      86
Self-adjoint      4
Self-concordant functional      23
Self-scaled (or symmetric) cone      84
Strong duality      67
Strong feasibility      73
sym(x,D)      40
Val      65
Val*      66
Weak duality      66
А*      3
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2019
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте