Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Linear constraints, Feasible directions
Graph Chatbot
Related lectures (28)
Faster Gradient Descent: Projected Optimization Techniques
Covers faster gradient descent methods and projected gradient descent for constrained optimization in machine learning.
Convex Optimization: Epigraphs
Explores epigraphs, convexity of bivariate functions, and log-sum-exp functions in convex optimization.
Projected Gradient Descent
Explores convex constrained optimization through Projected Gradient Descent, focusing on tangent space and iterative minimization.
Geodesic Convexity: Theory and Applications
Explores geodesic convexity in metric spaces and its applications, discussing properties and the stability of inequalities.
Optimization Techniques: Stochastic Gradient Descent and Beyond
Discusses optimization techniques in machine learning, focusing on stochastic gradient descent and its applications in constrained and non-convex problems.
Proximal and Subgradient Descent: Optimization Techniques
Discusses proximal and subgradient descent methods for optimization in machine learning.
Convex Optimization: Sets and Functions
Introduces convex optimization through sets and functions, covering intersections, examples, operations, gradient, Hessian, and real-world applications.
Proximal Gradient Descent: Optimization Techniques in Machine Learning
Discusses proximal gradient descent and its applications in optimizing machine learning algorithms.
Previous
Page 2 of 2
Next