Johns Hopkins University 3 credits Electrical & Computer Engineering
Convex optimization is at the heart of many disciplines such as machine learning, signal processing, control, medical imaging, etc. In this course, we will cover theory and algorithms for convex optimization. The theory part includes convex analysis, convex optimization problems (LPs, QPs, SOCPS, SDPs, Conic Programs), and Duality Theory. We will then explore a diverse array of algorithms to solve convex optimization problems in a variety of applications, such as gradient methods, sub-gradient methods, accelerated methods, proximal algorithms, Newton’s method, and ADMM. A solid knowledge of Linear Algebra is needed for this course.
Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs — written from scratch to your course requirements.
Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.
Expert guides on essay writing, citation styles, study skills, and academic success.
View All Articles
Learn how to write a good research question for a paper. Narrow your topic, identify a research problem, and create a focused question with practical examples.
Learn how to choose a research topic you can actually research. Discover how to narrow broad ideas, find reliable sources, and develop a focused research question.
Learn how to cite sources in a research paper using APA, MLA, and Chicago styles, with in-text citation examples and reference-list tips.