Home /  Workshop /  Schedules /  Quadratic optimization subject to a fixed number of quadratic constraints is polynomial-time

Quadratic optimization subject to a fixed number of quadratic constraints is polynomial-time

Semidefinite Programming and Applications October 07, 2002 - October 11, 2002

October 10, 2002 (02:30 PM PDT - 03:20 PM PDT)
Speaker(s): Dimitrii Pasechnik
Location: SLMath: Eisenbud Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

241-1487-Quadratic optimization subject to a fixed number of quadratic constraints is polynomial-time-Dimitrii V. Pasechnik
Abstract No Abstract Uploaded
Supplements
Asset no preview pasechnik.pdf 4.21 MB application/pdf Download
Video/Audio Files

241-1487-Quadratic optimization subject to a fixed number of quadratic constraints is polynomial-time-Dimitrii V. Pasechnik

H.264 Video 241-1487-Quadratic_optimization_subject_to_a_fixed_number_of_quadratic_constraints_is_polynomial-time-Dimitrii_V._Pasechnik.mp4 43.7 MB video/mp4 Download
241-1487-Quadratic_optimization_subject_to_a_fixed_number_of_quadratic_constraints_is_polynomial-time-Dimitrii_V._Pasechnik.rm 14.9 MB application/vnd.rn-realmedia Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.