By Topic

Towards a New Paradigm for Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ho, Yu-Chi ; Gordon McKay Professor of Engineering and Applied Mathematics, Harvard University, USA; Chair Professor and Chief Scientist, Department of Automation, Tsinghua University, Beijing China

Traditional optimization procedures were mostly developed under the constraints of limited memory in computer hardware and based on the use of real variables. The most prominent example is the award winning simplex method of linear programming. It embodies the essence of point-to-point iteration based on local information of directions of feasible descent (for minimization problems). However, with the advance in inexpensive computer memory and the prevalence of combinatorial type of system optimization problems, emphasis in solution approaches begin to shifts towards set-to set iteration of narrowing down the search. In this talk we shall examine this developing paradigm for optimization and discuss progress in this field of research.

Published in:

Automation Science and Engineering, 2007. CASE 2007. IEEE International Conference on

Date of Conference:

22-25 Sept. 2007