Difference between revisions of "Trust-region methods"

From optimization
Jump to: navigation, search
Line 11: Line 11:
 
==Introduction==
 
==Introduction==
 
Content under title 1.
 
Content under title 1.
 +
Vast amount of non-linear mathematical programming (NLP) methods are based on solving quadratic models that represent the original non-linear problems.
 +
 +
 +
 
===Subtitle 1.1===
 
===Subtitle 1.1===
 
Content under subtitle 1.1.
 
Content under subtitle 1.1.

Revision as of 22:16, 21 April 2014

Authors: Wenhe (Wayne) Ye (ChE 345 Spring 2014) Steward: Dajun Yue, Fengqi You Date Presented: Apr. 10, 2014

Authors: Issac Newton, Albert Einstein (ChE 345 Spring 2014)

Steward: Dajun Yue, Fengqi You

Date Presented: Apr. 10, 2014

Contents

Introduction

Content under title 1. Vast amount of non-linear mathematical programming (NLP) methods are based on solving quadratic models that represent the original non-linear problems.


Subtitle 1.1

Content under subtitle 1.1.

Sub-subtitle 1.1.1

Content under 1.1.1

Subtitle 1.2

Content under subtitle 1.2.

Algorithm

Outline of the Trust-Region Algorithm

Illustrative Example

Strategies for Improvements

Improved Search Algorithm

Optimality

Global Convergence

Enhancements

Performance

Image

You must upload the image file first

Eistein.jpg

Figure 1: Crazy science

Equations

An easy way to do this is to hit the button in the editing toolbar that has a picture of a square root sign on it.

S_{\text{new}} = S_{\text{old}} - \frac{ \left( 5-T \right) ^2} {2} E=mc^2 a=bc

Conclusion

A brief summary

References

1. T.F. Edgar, D.M. Himmelblau, L.S. Lasdon, Optimization of Chemical Processes, McGraw-Hill, 2001.

2. L.T. Biegler, I.E. Grossmann, A.W. Westerberg, Systematic Methods of Chemical Process Design, Prentice-Hall: Upper Saddle River, 1997.