::  Hasil Pencarian  ::  Simpan CSV :: Kembali

Hasil Pencarian

 
Ditemukan 18 dokumen yang sesuai dengan query
cover
Murota, Kazuo, author
Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications...
Philadelphia : Society for Industrial and Applied Mathematics, 2003
e20443048
eBooks  Universitas Indonesia Library
cover
Udriste, Constantin
Dordrecht: Kluwer Academic Publishers, 1994
516.3 UDR c
Buku Teks  Universitas Indonesia Library
cover
Ben-Tal, Aharon, author
Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programming. The authors present the basic theory underlying these problems as well as their numerous applications in engineering, including synthesis of filters, Lyapunov stability analysis, and structural design. The...
Philadelphia : Society for Industrial and Applied Mathematics, 2001
e20442917
eBooks  Universitas Indonesia Library
cover
Barbu, Viorel, author
This book provides a self-contained presentation of basic results of the theory of convex sets and functions in infinite-dimensional spaces. The main emphasis is on applications to convex optimization and convex optimal control problems in Banach spaces. A distinctive feature is a strong emphasis on the connection between theory and...
Dordrecht, Netherlands: Springer, 2012
e20401364
eBooks  Universitas Indonesia Library
cover
Nesterov, Yurii, author
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for control problems and variational...
Philadelphia: Society for Industrial and Applied Mathematics, 1994
e20448479
eBooks  Universitas Indonesia Library
cover
Renegar, James, author
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...
Philadelphia : Society for Industrial and Applied Mathematics, 2001
e20442761
eBooks  Universitas Indonesia Library
cover
Lovasz, Laszlo, author
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. Two algorithms are studied in detail: the ellipsoid method and the simultaneous diophantine approximation...
Philadelphia: Society for Industrial and Applied Mathematics, 1986
e20448516
eBooks  Universitas Indonesia Library
cover
cover
Ekeland, Ivar, author
No one working in duality should be without a copy of Convex Analysis and Variational Problems. This book contains different developments of infinite dimensional convex programming in the context of convex analysis, including duality, minmax and Lagrangians, and convexification of nonconvex optimization problems in the calculus of variations (infinite dimension)....
Philadelphia : Society for Industrial and Applied Mathematics, 1999
e20442712
eBooks  Universitas Indonesia Library
cover
Rockafellar, R. Tyrrell, author
Provides a relatively brief introduction to conjugate duality in both finite- and infinite-dimensional problems. An emphasis is placed on the fundamental importance of the concepts of Lagrangian function, saddle-point, and saddle-value. General examples are drawn from nonlinear programming, approximation, stochastic programming, the calculus of variations, and optimal control...
Philadelphia: Society for Industrial and Applied Mathematics, 1974
e20448465
eBooks  Universitas Indonesia Library
<<   1 2   >>