David G. Luenberger

Yinyu Ye

This new edition covers the central concepts of practical optimization techniques, with an emphasis on methods that are both state-of-the-art and popular. One major insight is the connection between the purely analytical character of an optimization problem and the behavior of algorithms used to solve a problem. This was a major theme of the first edition of this book and the fourth edition expands and further illustrates this relationship. As in the earlier editions, the material in this fourth edition is organized into three separate parts. Part I is a self-contained introduction to linear programming. The presentation in this part is fairly conventional, covering the main elements of the underlying theory of linear programming, many of the most effective numerical algorithms, and many of its important special applications. Part II, which is independent of Part I, covers the theory of unconstrained optimization, including both derivations of the appropriate optimality conditions and an introduction to basic algorithms. This part of the book explores the general properties of algorithms and defines various notions of convergence. Part III extends the concepts developed in the second part to constrained optimization problems. Except for a few isolated sections, this part is also independent of Part I. It is possible to go directly into Parts II and III omitting Part I, and, in fact, the book has been used in this way in many universities. New to this edition is a chapter devoted to Conic Linear Programming, a powerful generalization of Linear Programming. Indeed, many conic structures are possible and useful in a variety of applications. It must be recognized, however, that conic linear programming is an advanced topic, requiring special study. Another important topic is an accelerated steepest descent method that exhibits superior convergence properties, and for this reason, has become quite popular. The proof of the convergence property for both standard and accelerated steepest descent methods are presented in Chapter 8. As in previous editions, end-of-chapter exercises appear for all chapters. From the reviews of the Third Edition: “... this very well-written book is a classic textbook in Optimization. It should be present in the bookcase of each student, researcher, and specialist from the host of disciplines from which practical optimization applications are drawn.” (Jean-Jacques Strodiot, Zentralblatt MATH, Vol. 1207, 2011)

Linear and Nonlinear Programming

This third edition of the classic textbook in Optimization has been fully revised and updated. It comprehensively covers modern theoretical insights in this crucial computing area, and will be required reading for analysts and operations researchers in a variety of fields. The book connects the purely analytical character of an optimization problem, and the behavior of algorithms used to solve it. Now, the third edition has been completely updated with recent Optimization Methods. The book also has a new co-author, Yinyu Ye of California’s Stanford University, who has written lots of extra material including some on Interior Point Methods.

Panos M. Pardalos

Vladimir L. Boginski

Clayton W. Commander

The objective of this book is to advance the current knowledge of sensor research particularly highlighting recent advances, current work, and future needs. The goal is to share current technologies and steer future efforts in directions that will benefit the majority of researchers and practitioners working in this broad field of study.

Sensors: Theory, Algorithms, and Applications

Xiaotie Deng

WINE 2005, the First Workshop on Internet and Network Economics (WINE 2005), took place in Hong Kong, China, December 15-17, 2005. The symposium aims to provide a forum for researchers working in Internet and Network Economic algorithms from all over the world. The final count of electronic submissions was 372, of which 108 were accepted. It consists of the main program of 31 papers, of which the submitter email accounts are: 10 from edu (USA) accounts, 3 from hk (Hong Kong), 2 each from il (Isreal), cn (China), ch (Switzerland), de (Germany), jp (Japan), gr (Greece), 1 each from hp. com, sohu. com, pl (Poland), fr (France), ca (Canada), and in (India). In addition, 77 papers from 20 countries or regions and 6 dot. coms were selected for 16 special focus tracks in the areas of Internet and Algorithmic Economics; E-Commerce Protocols; Security; Collaboration, Reputation and Social Networks; Algorithmic Mechanism; Financial Computing; Auction Algorithms; Online Algorithms; Collective Rationality; Pricing Policies; Web Mining Strategies; Network Economics; Coalition Strategies; Internet Protocols; Price Sequence; Equilibrium. We had one best student paper nomination: “Walrasian Equilibrium: Hardness, Approximations and Tracktable Instances” by Ning Chen and Atri Rudra. We would like to thank Andrew Yao for serving the conference as its Chair, with inspiring encouragement and far-sighted leadership. We would like to thank the International Program Committee for spending their valuable time and effort in the review process.

Yinyu Ye

About

Books

Join the club