This widely referenced textbook, first published in 1982 by Academic Press, is the authoritative and comprehensive treatment of some of the most widely used constrained optimization methods, including the augmented Lagrangian/multiplier and sequential quadratic programming methods. Among its special features, the book: 1) treats extensively augmented Lagrangian methods, including an exhaustive analysis of the associated convergence and rate of convergence properties 2) develops comprehensively sequential quadratic programming and other Lagrangian methods 3) provides a detailed analysis of differentiable and nondifferentiable exact penalty methods 4) presents nondifferentiable and minimax optimization methods based on smoothing 5) contains much in depth research not found in any other textbook

Constrained Optimization and Lagrange Multiplier Methods (Computer Science & Applied Mathematics)

Science & Math

Bertsekas, Dimitri P.

Mathematics

Academic Pr

Dynamic Programming: Deterministic and Stochastic Models

PRENTICE/HALL

Linear Network Optimization: Algorithms and Codes

Large-scale optimization is becoming increasingly important for students and professionals in electrical and industrial engineering, computer science, management science and operations research, and applied mathematics. Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems. It is the first text to clearly explain important recent algorithms such as auction and relaxation, proposed by the author and others for the solution of these problems. Its coverage of both theory and implementations make it particularly useful as a text for a graduate-level course on network optimization as well as a practical guide to state-of-the-art codes in the field. Bertsekas focuses on the algorithms that have proved successful in practice and provides FORTRAN codes that implement them. The presentation is clear, mathematically rigorous, and economical. Many illustrations, examples, and exercises are included in the text. Contents: Introduction. Simplex Methods. Dual Ascent Methods. Auction Algorithms. Performance and Comparisons. Appendixes.

Business & Money

Management & Leadership

Mit Pr

Large-scale optimization is becoming increasingly important for students and professionals in electrical and industrial engineering, computer science, management science and operations research, and applied mathematics. Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems. It is the first text to clearly explain important recent algorithms such as auction and relaxation, proposed by the author and others for the solution of these problems. Its coverage of both theory and implementations make it particularly useful as a text for a graduate-level course on network optimization as well as a practical guide to state-of-the-art codes in the field. Bertsekas focuses on the algorithms that have proved successful in practice and provides Fortan codes that implement them. The presentation is clear, mathematically rigorous, and economical. Many illustrations, examples, and exercises are included in the text. Dimitri P. Bertsekas is Professor of Electrical Engineering and Computer Science at M.I.T. . Contents: Introduction. Simplex Methods. Dual Ascent Methods. Auction Algorithms. Performance and Comparisons. Appendixes.

MIT Press]

This extensive rigorous texbook, developed through instruction at MIT, focuses on nonlinear and other types of optimization: iterative algorithms for constrained and unconstrained optimization, Lagrange multipliers and duality, large scale problems, and the interface between continuous and discrete optimization. Among its special features, the book: 1) provides extensive coverage of iterative optimization methods within a unifying framework 2) provides a detailed treatment of interior point methods for linear programming 3) covers in depth duality theory from both a variational and a geometrical/convex analysis point of view 4) includes much new material on a number of topics, such as neural network training, discrete-time optimal control, and large-scale optimization 5) includes a large number of examples and exercises detailed solutions of many of which are posted on the internet Much supplementary/support material can be found at the book's web page

Nonlinear Programming

Dimitri P. Bertsekas

Athena Scientific

This highly acclaimed work, first published by Prentice Hall in 1989, is a comprehensive and theoretically sound treatment of parallel and distributed numerical methods. It focuses on algorithms that are naturally suited for massive parallelization, and it explores the fundamental convergence, rate of convergence, communication, and synchronization issues associated with such algorithms. This is an extensive book, which aside from its focus on parallel and distributed algorithms, contains a wealth of material on a broad variety of computation and optimization topics. Among its special features, the book: 1) Quantifies the performance of parallel algorithms, including the limitations imposed by the communication and synchronization penalties. 2) Describes communication algorithms for a variety of system architectures including tree, mesh, and hypercube. 3) Provides a comprehensive convergence analysis of asynchronous methods and a comparison with their asynchronous counterparts. 4) Cove

Parallel and Distributed Computation: Numerical Methods (Optimization and Neural Computation)

John Tsitsiklis

Tsitsiklis, John

Computers & Technology

An insightful, comprehensive, and up-to-date treatment of linear, nonlinear, and discrete/combinatorial network optimization problems, their applications, and their analytical and algorithmic methodology. It covers extensively theory, algorithms, and applications, and it aims to bridge the gap between linear and nonlinear network optimization on one hand, and integer/combinatorial network optimization on the other. Among its special features, the book: 1) provides a comprehensive account of the principal algorithms for linear network flow problems, including simplex, dual ascent, and auction algorithms 2) describes the application of network algorithms in many practical contexts, with special emphasis on data communication networks 3) develops in detail the computational complexity analysis of the main linear network optimization algorithms 4) covers extensively the main algorithms for specialized network problems, such as shortest path, max-flow, assignment, and traveling salesman 5) describes the main models for discrete network optimization problems, such as constrained shortest path, traveling salesman, vehicle routing, multidimensional assignment, facility location, spanning tree construction, etc 6) describes the main algorithmic approaches for integer-constrained network problems, such as branch-and-bound, Lagrangian relaxation and subgradient optimization, genetic algorithms, tabu search, simulated annealing, and rollout algorithms 7) develops the main methods for nonlinear network problems, such as convex separable and multicommodity flow problems arising in communication, transportation, and manufacturing contexts 8) discusses extensively auction algorithms, based on the author's original research on the subject 9) contains many examples, practical applications, illustrations, and exercises 10) contains much new material not found in any other textbook

Network Optimization: Continuous and Discrete Models (Optimization, Computation, and Control)

Certification

This research monograph is the authoritative and comprehensive treatment of the mathematical foundations of stochastic optimal control of discrete-time systems, including the treatment of the intricate measure-theoretic issues.

Stochastic Optimal Control: The Discrete-Time Case (Optimization and Neural Computation Series)

Steven E. Shreve

Shreve, Steven E.

This widely referenced textbook, first published in 1982 by Academic Press, is the authoritative and comprehensive treatment of some of the most widely used constrained optimization methods, including the augmented Lagrangian/multiplier and sequential quadratic programming methods. Among its special features, the book: 1) treats extensively augmented Lagrangian methods, including an exhaustive analysis of the associated convergence and rate of convergence properties 2) develops comprehensively sequential quadratic programming and other Lagrangian methods 3) provides a detailed analysis of differentiable and nondifferentiable exact penalty methods 4) presents nondifferentiable and minimax optimization methods based on smoothing 5) contains much in depth research not found in any other textbook

Constrained Optimization and Lagrange Multiplier Methods (Optimization and neural computation series)

The third edition of the book is a thoroughly rewritten version of the 1999 2nd edition. New material was included, some of the old material was discarded, and a large portion of the remainder was reorganized or revised. This book provides a comprehensive and accessible presentation of algorithms for solving continuous optimization problems. It relies on rigorous mathematical analysis, but also aims at an intuitive exposition that makes use of visualization where possible. It places particular emphasis on modern developments, and their widespread applications in fields such as large-scale resource allocation problems, signal processing, and machine learning. The book was developed through instruction at MIT, focuses on nonlinear and other types of optimization: iterative algorithms for constrained and unconstrained optimization, Lagrange multipliers and duality, large scale problems, and the interface between continuous and discrete optimization. Among its special features, the book: 1) provides extensive coverage of iterative optimization methods within a unifying framework 2) provides a detailed treatment of interior point methods for linear programming 3) covers in depth duality theory from both a variational and a geometrical/convex analysis point of view 4) includes much new material on a number of topics, such as neural network training, large-scale optimization, signal processing, machine learning, and optimal control 5) includes a large number of examples and exercises detailed solutions of many of which are posted on the internet. Much supplementary/support material can be found at the publisher's and the author's web sites

See the best price to sell, buy, or rent books by Bertsekas, Dimitri P.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Bertsekas, Dimitri P.

See the best price to sell, buy, or rent books by Bertsekas, Dimitri P.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Constrained Optimization and Lagrange Multiplier Methods (Computer Science & Applied Mathematics)

Dynamic Programming: Deterministic and Stochastic Models

Linear Network Optimization: Algorithms and Codes

Linear Network Optimization: Algorithms and Codes

Nonlinear Programming

Parallel and Distributed Computation: Numerical Methods (Optimization and Neural Computation)

Network Optimization: Continuous and Discrete Models (Optimization, Computation, and Control)

Stochastic Optimal Control: The Discrete-Time Case (Optimization and Neural Computation Series)

Constrained Optimization and Lagrange Multiplier Methods (Optimization and neural computation series)

Nonlinear Programming