## Main.InteriorPointMethod History

Hide minor edits - Show changes to output

Added line 14:

** [[Attach:interior_point_example4.zip|MATLAB Code for Example 4]]

Added lines 14-17:

(:html:)

<iframe width="560" height="315" src="//www.youtube.com/embed/oVqpaZB48eM?rel=0" frameborder="0" allowfullscreen></iframe>

(:htmlend:)

Changed line 12 from:

** [[Attach:interior_point_example3.zip|~~Interior Point Method~~ Example 3~~ MATLAB Code~~]]

to:

** [[Attach:interior_point_example3.zip|MATLAB Code for Example 3]]

Added line 12:

** [[Attach:interior_point_example3.zip|Interior Point Method Example 3 MATLAB Code]]

Changed lines 28-29 from:

* [[~~http~~:~~//apmonitor~~.~~com/online/view_pass.php?f=ipm.apm~~|Problem 2 MATLAB Solution with BPOPT Solver]]

* [[http://apmonitor.com/online/view_pass.php?f=ipm.apm|Problem 2 Online Solution with IPOPT Solver]]

* [[http://apmonitor.com/online/view_pass.php?f=ipm.apm|Problem 2 Online Solution with IPOPT Solver]]

to:

* [[Attach:bpopt_matlab.zip|Homework Problem 2 MATLAB Solution with BPOPT Solver]]

* [[http://apmonitor.com/online/view_pass.php?f=ipm.apm|Homework Problem 2 Online Solution with IPOPT Solver]]

* [[http://apmonitor.com/online/view_pass.php?f=ipm.apm|Homework Problem 2 Online Solution with IPOPT Solver]]

Added lines 27-29:

* [[http://apmonitor.com/online/view_pass.php?f=ipm.apm|Problem 2 MATLAB Solution with BPOPT Solver]]

* [[http://apmonitor.com/online/view_pass.php?f=ipm.apm|Problem 2 Online Solution with IPOPT Solver]]

Changed lines 7-8 from:

* [[Attach:interior_point_lecture.pdf|Interior Point Method Notes]]

to:

* [[Attach:interior_point_lecture.pdf|Interior Point Method Lecture Notes]]

Changed lines 21-26 from:

!!!! ~~Additional ~~Interior Point ~~Exercises~~

Two exercises involve setting up and solving nonlinear programming problems with the interior point method.~~The following animations demonstrate how the barrier term influences the objective contours. As the value of the barrier term (mu) decreases, the contours of the barrier problem approach the original objective contours.~~

* [[Attach:interior_point_hw.pdf|Interior Point Method Worksheet]]

Two exercises involve setting up and solving nonlinear programming problems with the interior point method.

* [[Attach:interior_point_hw.pdf|Interior Point Method Worksheet

to:

!!!! Interior Point Homework

Two exercises involve setting up and solving nonlinear programming problems with the interior point method.

* [[Attach:interior_point_hw.pdf|Interior Point Method Homework]]

Two exercises involve setting up and solving nonlinear programming problems with the interior point method.

* [[Attach:interior_point_hw.pdf|Interior Point Method Homework]]

Added lines 28-29:

The following animations demonstrate how the barrier term influences the objective contours. As the value of the barrier term (mu) decreases, the contours of the barrier problem approach the original objective contours.

Changed lines 8-10 from:

to:

* [[Attach:interior_point_example1.pdf|Interior Point Method Example 1]]

* [[Attach:interior_point_example2.pdf|Interior Point Method Example 2]]

* [[Attach:interior_point_example3.pdf|Interior Point Method Example 3]]

* [[Attach:interior_point_example4.pdf|Interior Point Method Example 4]]

Interior point methods are best suited for very large-scale problems with many degrees of freedom (design variables). Interior point methods are also relatively simple to code into a mathematical program. We will work with interior point methods to investigate the algorithmic details of constrained optimization.

* [[Attach:interior_point_example2.pdf|Interior Point Method Example 2]]

* [[Attach:interior_point_example3.pdf|Interior Point Method Example 3]]

* [[Attach:interior_point_example4.pdf|Interior Point Method Example 4]]

Interior point methods are best suited for very large-scale problems with many degrees of freedom (design variables). Interior point methods are also relatively simple to code into a mathematical program. We will work with interior point methods to investigate the algorithmic details of constrained optimization.

Changed lines 17-18 from:

The difficulty of the last few assignments has been reduced to allow time for work on the [[Main/SolverProject|Final Project]]. Please use the additional time this week to develop ~~a~~ project~~ scope~~.

to:

The difficulty of the last few assignments has been reduced to allow time for work on the [[Main/SolverProject|Final Project]]. Please use the additional time this week to develop your project.

Changed line 21 from:

!!!! Interior Point Exercises

to:

!!!! Additional Interior Point Exercises

Deleted line 6:

Changed lines 15-18 from:

-~~> Attach:barrier_contour.gif~~

* [[Attach:create_animation.zip|Create an Animated Contour Plot with Python on Windows OS]]

* [[Attach:create_animation.zip|Create an Animated Contour Plot with Python on Windows OS

to:

----

!!!! Interior Point Exercises

Two exercises involve setting up and solving nonlinear programming problems with the interior point method. The following animations demonstrate how the barrier term influences the objective contours. As the value of the barrier term (mu) decreases, the contours of the barrier problem approach the original objective contours.

* [[Attach:interior_point_hw.pdf|Interior Point Method Worksheet]]

----

-> Attach:barrier_contour_hw1.gif

* [[Attach:create_animation_hw1.zip|Source Code for this Animated Contour Plot with Python on Windows OS]]

----

-> Attach:barrier_contour.gif

* [[Attach:create_animation.zip|Source Code for this Animated Contour Plot with Python on Windows OS]]

!!!! Interior Point Exercises

Two exercises involve setting up and solving nonlinear programming problems with the interior point method. The following animations demonstrate how the barrier term influences the objective contours. As the value of the barrier term (mu) decreases, the contours of the barrier problem approach the original objective contours.

* [[Attach:interior_point_hw.pdf|Interior Point Method Worksheet]]

----

-> Attach:barrier_contour_hw1.gif

* [[Attach:create_animation_hw1.zip|Source Code for this Animated Contour Plot with Python on Windows OS]]

----

-> Attach:barrier_contour.gif

* [[Attach:create_animation.zip|Source Code for this Animated Contour Plot with Python on Windows OS]]

Added lines 9-12:

Interior point methods are best suited for very large-scale problems with many degrees of freedom (design variables). Interior point methods are also the simplest to code into a mathematical program. We will work with interior point methods to investigate the algorithmic details of constrained optimization.

# A. Wächter and L. T. Biegler, On the Implementation of an Interior-Point Filter Line-Search Algorithm for Large-Scale Nonlinear Programming, Mathematical Programming 106(1), pp. 25-57, 2006. [[http://cepac.cheme.cmu.edu/pasilectures/biegler/ipopt.pdf|Download PDF]]

Added line 8:

* [[Attach:interior_point_lecture.pdf|Interior Point Method Notes]]

Changed line 13 from:

* [[Attach:create_animation.zip|Create ~~An~~ Animated Contour Plot with Python on Windows OS]]

to:

* [[Attach:create_animation.zip|Create an Animated Contour Plot with Python on Windows OS]]

Changed line 13 from:

* [[Attach:create_animation.zip|Create An Animated Contour Plot ~~in~~ Windows]]

to:

* [[Attach:create_animation.zip|Create An Animated Contour Plot with Python on Windows OS]]

Added lines 12-13:

* [[Attach:create_animation.zip|Create An Animated Contour Plot in Windows]]

Added lines 8-9:

The difficulty of the last few assignments has been reduced to allow time for work on the [[Main/SolverProject|Final Project]]. Please use the additional time this week to develop a project scope.

Added lines 1-32:

(:title Interior Point Methods:)

(:keywords Interior Point Method, Lagrange Multiplier, Optimization, Constraint, Nonlinear Programming:)

(:description Homework on Interior Point Methods for Nonlinear Programming including a number of exercises.:)

Interior point methods or barrier methods are a certain class of algorithms to solve linear and nonlinear convex optimization problems. Violation of inequality constraints are prevented by augmenting the objective function with a barrier term that causes the optimal unconstrained value to be in the feasible space.

* [[Attach:interior_point_hw.pdf|Interior Point Method Homework]]

-> Attach:barrier_contour.gif

----

Attach:group50.png This assignment can be completed in groups of two. Additional guidelines on individual, collaborative, and group assignments are provided under the [[Main/CourseStandards | Expectations link]].

----

(:html:)

<div id="disqus_thread"></div>

<script type="text/javascript">

/* * * CONFIGURATION VARIABLES: EDIT BEFORE PASTING INTO YOUR WEBPAGE * * */

var disqus_shortname = 'apmonitor'; // required: replace example with your forum shortname

/* * * DON'T EDIT BELOW THIS LINE * * */

(function() {

var dsq = document.createElement('script'); dsq.type = 'text/javascript'; dsq.async = true;

dsq.src = 'http://' + disqus_shortname + '.disqus.com/embed.js';

(document.getElementsByTagName('head')[0] || document.getElementsByTagName('body')[0]).appendChild(dsq);

})();

</script>

<noscript>Please enable JavaScript to view the <a href="http://disqus.com/?ref_noscript">comments powered by Disqus.</a></noscript>

<a href="http://disqus.com" class="dsq-brlink">comments powered by <span class="logo-disqus">Disqus</span></a>

(:htmlend:)

(:keywords Interior Point Method, Lagrange Multiplier, Optimization, Constraint, Nonlinear Programming:)

(:description Homework on Interior Point Methods for Nonlinear Programming including a number of exercises.:)

Interior point methods or barrier methods are a certain class of algorithms to solve linear and nonlinear convex optimization problems. Violation of inequality constraints are prevented by augmenting the objective function with a barrier term that causes the optimal unconstrained value to be in the feasible space.

* [[Attach:interior_point_hw.pdf|Interior Point Method Homework]]

-> Attach:barrier_contour.gif

----

Attach:group50.png This assignment can be completed in groups of two. Additional guidelines on individual, collaborative, and group assignments are provided under the [[Main/CourseStandards | Expectations link]].

----

(:html:)

<div id="disqus_thread"></div>

<script type="text/javascript">

/* * * CONFIGURATION VARIABLES: EDIT BEFORE PASTING INTO YOUR WEBPAGE * * */

var disqus_shortname = 'apmonitor'; // required: replace example with your forum shortname

/* * * DON'T EDIT BELOW THIS LINE * * */

(function() {

var dsq = document.createElement('script'); dsq.type = 'text/javascript'; dsq.async = true;

dsq.src = 'http://' + disqus_shortname + '.disqus.com/embed.js';

(document.getElementsByTagName('head')[0] || document.getElementsByTagName('body')[0]).appendChild(dsq);

})();

</script>

<noscript>Please enable JavaScript to view the <a href="http://disqus.com/?ref_noscript">comments powered by Disqus.</a></noscript>

<a href="http://disqus.com" class="dsq-brlink">comments powered by <span class="logo-disqus">Disqus</span></a>

(:htmlend:)