"Convex optimization" refers to the objective function is convex function and the constraint conditions are the domain of optimization problem for convex set. Article is MIT public class notes.

MIT开放课：凸分析和最优化
.........................\6253cover.pdf
.........................\lec_1.pdf
.........................\lec_10.pdf
.........................\lec_11.pdf
.........................\lec_12.pdf
.........................\lec_13.pdf
.........................\lec_14.pdf
.........................\lec_15.pdf
.........................\lec_16.pdf
.........................\lec_17.pdf
.........................\lec_18.pdf
.........................\lec_19.pdf
.........................\lec_2.pdf
.........................\lec_20.pdf
.........................\lec_21.pdf
.........................\lec_22.pdf
.........................\lec_23.pdf
.........................\lec_24.pdf
.........................\lec_25.pdf
.........................\lec_26.pdf
.........................\lec_3.pdf
.........................\lec_4.pdf
.........................\lec_5.pdf
.........................\lec_6.pdf
.........................\lec_7.pdf
.........................\lec_8.pdf
.........................\lec_9.pdf
.........................\new_look.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．