Strongly polynomial algorithm for a class of nonlinear minimum-cost flow problems

Add to your list(s) Download to your calendar using vCal

• László Végh (LSE)
• Monday 11 February 2013, 15:00-16:00
• MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.

If you have a question about this talk, please contact Felix Fischer.

A well-studied nonlinear extension of the minimum-cost flow problem is replacing the linear objective by a separable convex one. We give a strongly polynomial algorithm for finding an exact optimal solution for a broad class of such problems. This class includes convex quadratic objectives and multiple market equilibrium computation problems as well.

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Economics and Computer Science Talks
• Hanchen DaDaDash
• Interested Talks
• MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
• Optimization and Incentives Seminar
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.