Zero-order and Dynamic Sampling Methods for Nonlinear Optimization

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=OfVZ9gArXiY


Duration: 42:21
1,106 views
9

Jorge Nocedal, Northwestern University
https://simons.berkeley.edu/talks/jorge-nocedal-10-03-17
Fast Iterative Methods in Optimization



Other Videos By Simons Institute for the Theory of Computing


2017-10-06Will Vanishing Gradients Ever Vanish from Deep Learning?
2017-10-05Nonconvex Optimization for High-dimensional Learning: From ReLUs to Submodular Maximization
2017-10-05Faster Algorithms and New Iterative Methods for Computing the Stationary Distribution
2017-10-05Trends in Large-scale Nonconvex Optimization
2017-10-04Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage
2017-10-04Randomized Iterative Methods and Complexity for Markov Decision Process
2017-10-04Hashing-based-estimators for Kernel Density in High Dimensions
2017-10-04Sublinear Time Low-rank Approximation of Positive Semidefinite Matrices
2017-10-04Sketching as a Tool for Fast Algorithm Design
2017-10-03Dealing with Linear Constraints via Random Permutation
2017-10-03Zero-order and Dynamic Sampling Methods for Nonlinear Optimization
2017-10-03Algorithmic Tools for Smooth Nonconvex Optimization
2017-10-03Stochastic, Second-order Black-box Optimization for Step Functions
2017-10-03Let's Make Block Coordinate Descent Go Fast
2017-10-03The State of Contemporary Computing Substrates for Optimization Methods
2017-10-02On the Optimization Landscape of Matrix and Tensor Decomposition Problems
2017-10-02Chordal Graphs and Sparse Semidefinite Optimization
2017-10-02Michael Cohen and ell_p Regression
2017-10-02Slime Molds and Sparse Recovery
2017-10-02Width-independent Iterative Algorithms for Packing and Covering Programs
2017-10-02Continuous Methods for Discrete Optimization: From Convex Relaxations, to Iterative Schemes...


Tags:
Jorge Nocedal
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Fast Iterative Methods in Optimization