Convex Sets;Convex Functions;Concave Functions;Maximum Likelihood Estimators;MLE;First Order Condition;Second Order Condition;Curve Fitting;Newton's Method;False Position Method;Rate of Covergence;Quadratic Fitting;Cubic Fitting;Unimodel Function;Fibonacci Search;Unconstrained Optimization;Line Search;Local Minimum;Local Maximum;Least Squares;Linear Regression;Logistic Regression;Linear Neural Networks;Steepest Descent;Gradient Descent;Quasi-Newton;Expectation-maximization Algorithm;Constrained Optimization;Allocation Problems;Linear Constrains;Linear Programming;Lagrange Multipliers;Dual Variables; Best Linear Unbiased Estimator;Shadow Price;Duality;Non-Linear Programming;Quadratic Programming;KKT;Karush-Kuhn-Tacker;Convex Programming;Support Vector Machine;Lagrangian Method;Penalty Functions;Barrier Functions;Simplex;Feasible Solution;Transportation Problem;Representation Theorem;Sensitivity Analysis
Pay easily by card, Klarna, Apple Pay or Google Pay. Not happy? You always have a 14-day money-back guarantee. Read more in our terms. If you have any questions, email us at hello@memmo.org.
Memmo makes studying easier – wherever you are in the world. We bring your course books and smart study tools together in one place: summaries, quizzes, podcasts and flashcards. Plus Ted, your study buddy who answers anything you wonder. Over 75,000 students already study here – built to help you learn faster and stress less.
You might also like
Buy the book0