Optimization algorithms and methods | Fair division protocols
In computer science and operations research, the envy minimization problem is the problem of allocating discrete items among agents with different valuations over the items, such that the amount of envy is as small as possible. Ideally, from a fairness perspective, one would like to find an envy-free item allocation - an allocation in which no agent envies another agent. That is: no agent prefers the bundle allocated to another agent. However, with indivisible items this might be impossible. One approach for coping with this impossibility is to turn the problem to an optimization problem, in which the loss function is a function describing the amount of envy. In general, this optimization problem is NP-hard, since even deciding whether an envy-free allocation exists is equivalent to the partition problem. However, there are optimization algorithms that can yield good results in practice. (Wikipedia).
Minimax Approximation and the Exchange Algorithm
In this video we'll discuss minimax approximation. This is a method of approximating functions by minimisation of the infinity (uniform) norm. The exchange algorithm is an iterative method of finding the approximation which minimises the infinity norm. FAQ : How do you make these animatio
From playlist Approximation Theory
A practical understanding and approach to optimizing functions using calculus
From playlist Older Statistics Videos and Other Math Videos
Business Math - The Simplex Method (8 of 15) Standard Minimization - The Dual Problem
Visit http://ilectureonline.com for more math and science lectures! In this video I will find the dual problem of a standard minimization problem. Next video in this series can be seen at: http://youtu.be/xJ78dUmsl34
From playlist BUSINESS MATH - THE SIMPLEX METHOD
Business Math - The Simplex Method (7 of 15) Minimization Problem - Convert to Maximization
Visit http://ilectureonline.com for more math and science lectures! In this video I will minimize cost (converting to maximization) using the simplex method. Next video in this series can be seen at: http://youtu.be/GabSiPza3BE
From playlist BUSINESS MATH - THE SIMPLEX METHOD
85 Years of Nielsen Theory: Periodic Points
Part 2 of a 3 part series of expository talks on Nielsen theory I gave at the conference on Nielsen Theory and Related Topics in Daejeon Korea, June 25, 2013. Part 1- Fixed Points: http://youtu.be/1Ls8mTkRtX0 Part 3- Coincidence Points: http://youtu.be/Wu2Cr3v_I44 Chris Staecker's intern
From playlist Research & conference talks
What is Optimisation? (3 of 6: Example derivative)
More resources available at www.misterwootube.com
From playlist Applications of Differentiation
This video is about Line Minimization Algorithm
From playlist Optimization
David Meyer (1/30/18): Some algebraic stability theorems for generalized persistence modules
From an algebraic point of view, generalized persistence modules can be interpreted as finitely-generated modules for a poset algebra. We prove an algebraic analogue of the isometry theorem of Bauer and Lesnick for a large class of posets. This theorem shows that for such posets, the int
From playlist AATRN 2018
Optimization Problems in Calculus
What good is calculus anyway, what does it have to do with the real world?! Well, a lot, actually. Optimization is a perfect example! If you want to figure out how to maximize your profits or minimize your costs, or if you want to maximize an area or minimize a distance, you are finding th
From playlist Calculus
Equally sharing a cake between three people - Numberphile
Audible (30-day trial, free audio book): https://www.audible.com/numberphile More links & stuff in full description below ↓↓↓ This video features Dr Hannah Fry. More videos with Hannah: http://bit.ly/hannah_vids Hannah's website: http://www.hannahfry.co.uk Her book mentioned is "The Mathe
From playlist Women in Mathematics - Numberphile
13_2 Optimization with Constraints
Here we use optimization with constraints put on a function whose minima or maxima we are seeking. This has practical value as can be seen by the examples used.
From playlist Advanced Calculus / Multivariable Calculus
With Geometry or With Algebra, that is the question. A constrained minimization problem.
This is a minimization problem with algebraic constraint. But geometric intuition wins over the conventional method with algebraic inequality Real numbers x, y satisfy |x| + |y| = \sqrt{(x-1)^2 + (y-1)^2} What the min value of x^2 + y^2 ? We present a geometric method. Leave the algebrai
From playlist Inequalities for Math Olympiad Series
Claim your SPECIAL OFFER for MagellanTV here: https://try.magellantv.com/historyguy. Start your free trial TODAY so you can watch Tobago 1677 about the Dutch defense of Tobago during the Franco-Dutch War, and the rest of MagellanTV’s history collection: https://www.magellantv.com/video/tob
From playlist Economic History
Laurence Olivier as Akash in 'Time-The Musical' (1986)
Soundtrack of the 1986 West End play Time - The Musical. Music: Jeff Daniels Lyrics: Dave Clark and David Soames Transcript: Beauty... Truth... Love... Freedom... Peace... These are your ideals. There is not one person on the entire planet Earth who, in his right mind, doesn
From playlist Radio Drama Starring Laurence Olivier
Satoru Fujishige: Combinatorial Polynomial Algorithms for Skew bisubmodular Function Minimization
Huber, Krokhin, and Powell (2013) introduced a concept of skew bisubmodularity, as a generalization of bisubmodularity, in their complexity dichotomy theorem for valued constraint satisfaction problems over the three-value domain, and they showed the oracle tractability of minimization of
From playlist HIM Lectures 2015
Blaine LAWSON - A Monge - Ampère Operator in Symplectic Geometry
Talk presented by P. PANSU https://indico.math.cnrs.fr/event/2432/material/17/0.pdf
From playlist Riemannian Geometry Past, Present and Future: an homage to Marcel Berger
Jupyter/IPython Dev Meeting, November 22, 2016
Meeting of the Jupyter/IPython development team, November 22, 2016 Meeting Notes: https://jupyter.hackpad.com/November-2016-weekly-meetings-ODhDM77jlsd
From playlist Jupyter / IPython dev meetings
FUT1441 SUSE Linux Enterprise Server for SAP Solutions Roadmap
This future session was delivered at SUSECON in April 2019, in Nashville, TN. Abstract: Come and join this session to learn about the latest news about SLES for SAP Solutions. Besides the recent announcement about NVDimm support for SAP HANA, we will also review updates in the area of High
From playlist SUSECON 2019
Justin Lynd: Control of fixed points and centric linking systems
The lecture was held within the framework of the (Junior) Hausdorff Trimester Program Topology: Workshop "Fusion systems and equivariant algebraic topology"
From playlist HIM Lectures: Junior Trimester Program "Topology"
Minimization problems and the closest point to a subspace. Approximating sin x with polynomials, better on average than with the Taylor polynomial.
From playlist Linear Algebra Done Right