Convex Optimization I

Stanford Course , Prof. Stephen Boyd

380 students enrolled

Overview

Contents:
Introduction - Guest-Logistics, Convex Functions - Vector Composition - Optimal And Locally Optimal Points - Linear-Fractional Program - Generalized Inequality Constraints - Lagrangian, Lagrange Dual Function - Complementary Slackness - Applications Section Of The Course-Statistical Estimation - Continue On Experiment Design - Linear Discrimination (Cont.),LU Factorization (Cont.) - Algorithm Section Of The Course - Continue On Unconstrained Minimization - Newton - Logarithmic Barrier-Interior-Point Methods

Lecture 10: Applications Section Of The Course

Up Next
You can skip ad in
SKIP AD >
Advertisement
      • 2x
      • 1.5x
      • 1x
      • 0.5x
      • 0.25x
        EMBED LINK
        COPY
        DIRECT LINK
        PRIVATE CONTENT
        OK
        Enter password to view
        Please enter valid password!
        0:00
        0 (0 Ratings)

        LECTURES



        Review


        0

        0 Rates
        1
        0%
        0
        2
        0%
        0
        3
        0%
        0
        4
        0%
        0
        5
        0%
        0

        Comments Added Successfully!
        Please Enter Comments
        Please Enter CAPTCHA
        Invalid CAPTCHA
        Please Login and Submit Your Comment