World Mentoring Academy "An Open Community for Successful Learning"
Free World class mobile education, earn a Bachelors for less than $5,000 books & Test Fees from State Universities, using Experiential, Design & Project based education. Supporting credit-by-exam & Challenging University courses.
Information for lesson "Convex Optimization I & II (EE 364A&B) Stanford"
Description: (EE364A)Convex sets, functions, and optimization problems. The basics of convex analysis and theory of convex programming: optimality conditions, duality theory, theorems of alternative, and applications. Least-squares, linear and quadratic programs, semidefinite programming, and geometric programming. Numerical algorithms for smooth and equality constrained problems; interior-point methods for inequality constrained problems. Applications to signal processing, communications, control, analog and digital circuit design, computational geometry, statistics, machine learning, and mechanical engineering. (EE364B) Subgradient, cutting-plane, and ellipsoid methods. Decentralized convex optimization via primal and dual decomposition. Exploiting problem structure in implementation. Convex relaxations of hard problems. Global optimization via branch and bound. Robust and stochastic optimization. Applications in areas such as control, circuit design, signal processing, and communications.
Resources: OpenCourseware from Yale, UC Berkeley, Stanford, MIT along with many of the World's finest University's.
Professors: Michael Williams
Interested in Mentoring? We are looking for mentors/teachers who are amateurs or professionals in every field. Drop me a line at mike @ worldmentoringacademy . com (in subject line "teaching course")