Topic: Optimization and Newton's Method

Why Newton’s Method Converges Quadratically Near A Simple Root

Why Integer Choices Need A Final Comparison

Why Closed-Interval Optimization Has Finite Candidates

When A Feasible Boundary Is Not Attained

Using Logarithms To Simplify Positive Objectives

Translating Optimization Descriptions Into Constraints

Stopping Rules Based On Steps And Residuals

Oscillation And Divergence In Newton’s Method

Optimizing A Rectangle With Fixed Perimeter

Optimizing With Piecewise Constraints