Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Mathematical programming

Showing results (1-10 of 65) with videos related to

Pageof 7
Sort By:
Mathematical Programming|November 1, 2021
Stochastic quasi-gradient methods: variance reduction via Jacobian sketchingRobert M Gower, Peter Richtárik, Francis Bach
Mathematical Programming|March 18, 2022
Idealness of <i>k</i>-wise intersecting familiesAhmad Abdi, Gérard Cornuéjols, Tony Huynh, et al.
Mathematical Programming|September 4, 2025
Dyadic linear programming and extensionsAhmad Abdi, Gérard Cornuéjols, Bertrand Guenin, et al.
Mathematical Programming|April 9, 2021
Gradient Descent with Random Initialization: Fast Global Convergence for Nonconvex Phase RetrievalYuxin Chen, Yuejie Chi, Jianqing Fan, et al.
Mathematical Programming|September 1, 2020
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloringElisabeth Gaar, Franz Rendl
Mathematical Programming|September 1, 2020
An efficient characterization of submodular spanning tree gamesZhuan Khye Koh, Laura Sanità
Mathematical Programming|June 20, 2025
Matrix discrepancy and the log-rank conjectureBenny Sudakov, István Tomon
Mathematical Programming|December 12, 2017
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutionsHongcheng Liu, Tao Yao, Runze Li, et al.
Mathematical Programming|November 15, 2021
Optimality and fairness of partisan gerrymanderingAntoine Lagarde, Tristan Tomala
Mathematical Programming|November 15, 2021
Strengthening convex relaxations of 0/1-sets using Boolean formulasSamuel Fiorini, Tony Huynh, Stefan Weltge
Pageof 7

Showing results (1-10 of 65) with videos related to

Sort By:
Pageof 7
Mathematical Programming|November 1, 2021
Stochastic quasi-gradient methods: variance reduction via Jacobian sketchingRobert M Gower, Peter Richtárik, Francis Bach
Mathematical Programming|March 18, 2022
Idealness of <i>k</i>-wise intersecting familiesAhmad Abdi, Gérard Cornuéjols, Tony Huynh, et al.
Mathematical Programming|September 4, 2025
Dyadic linear programming and extensionsAhmad Abdi, Gérard Cornuéjols, Bertrand Guenin, et al.
Mathematical Programming|April 9, 2021
Gradient Descent with Random Initialization: Fast Global Convergence for Nonconvex Phase RetrievalYuxin Chen, Yuejie Chi, Jianqing Fan, et al.
Mathematical Programming|September 1, 2020
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloringElisabeth Gaar, Franz Rendl
Mathematical Programming|September 1, 2020
An efficient characterization of submodular spanning tree gamesZhuan Khye Koh, Laura Sanità
Mathematical Programming|June 20, 2025
Matrix discrepancy and the log-rank conjectureBenny Sudakov, István Tomon
Mathematical Programming|December 12, 2017
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutionsHongcheng Liu, Tao Yao, Runze Li, et al.
Mathematical Programming|November 15, 2021
Optimality and fairness of partisan gerrymanderingAntoine Lagarde, Tristan Tomala
Mathematical Programming|November 15, 2021
Strengthening convex relaxations of 0/1-sets using Boolean formulasSamuel Fiorini, Tony Huynh, Stefan Weltge
Pageof 7