BSc: DecentralizedPptimizationTransportProblemsSpectralPropertiesOfGraphs - Revision history

V.matiukhin at 15:52, 2 April 2024

2024-04-02T15:52:34Z

← Older revision		Revision as of 15:52, 2 April 2024
Line 127:		Line 127:
	[4] Scaman, K., Bach, F., Bubeck, S., Massoulié, L., & Lee, Y. T. (2018). Optimal algorithms for non-smooth distributed optimization in networks. Advances in Neural Information Processing Systems, 31.<br>		[4] Scaman, K., Bach, F., Bubeck, S., Massoulié, L., & Lee, Y. T. (2018). Optimal algorithms for non-smooth distributed optimization in networks. Advances in Neural Information Processing Systems, 31.<br>
	[5] Drori, Y., Sabach, S., & Teboulle, M. (2015). A simple algorithm for a class of nonsmooth convex–concave saddle-point problems. Operations Research Letters, 43(2), 209-214.<br>		[5] Drori, Y., Sabach, S., & Teboulle, M. (2015). A simple algorithm for a class of nonsmooth convex–concave saddle-point problems. Operations Research Letters, 43(2), 209-214.<br>
		+	<br>

−	\|}
	'''Текущий контроль успеваемости обучающихся по дисциплине:'''		'''Текущий контроль успеваемости обучающихся по дисциплине:'''

2024-04-02T15:52:13Z

← Older revision		Revision as of 15:52, 2 April 2024
Line 122:		Line 122:
	\|}		\|}

−	*[1] https://sndlib.put.poznan.pl/home.action<br>	+	[1] https://sndlib.put.poznan.pl/home.action<br>
−	*[2] https://github.com/bstabler/TransportationNetworks <br>	+	[2] https://github.com/bstabler/TransportationNetworks <br>
−	*[3] https://www.cvxpy.org/<br>	+	[3] https://www.cvxpy.org/<br>
−	*[4] Scaman, K., Bach, F., Bubeck, S., Massoulié, L., & Lee, Y. T. (2018). Optimal algorithms for non-smooth distributed optimization in networks. Advances in Neural Information Processing Systems, 31.<br>	+	[4] Scaman, K., Bach, F., Bubeck, S., Massoulié, L., & Lee, Y. T. (2018). Optimal algorithms for non-smooth distributed optimization in networks. Advances in Neural Information Processing Systems, 31.<br>
−	*[5] Drori, Y., Sabach, S., & Teboulle, M. (2015). A simple algorithm for a class of nonsmooth convex–concave saddle-point problems. Operations Research Letters, 43(2), 209-214.<br>	+	[5] Drori, Y., Sabach, S., & Teboulle, M. (2015). A simple algorithm for a class of nonsmooth convex–concave saddle-point problems. Operations Research Letters, 43(2), 209-214.<br>

	\|}		\|}

2024-04-02T15:51:46Z

← Older revision		Revision as of 15:51, 2 April 2024
Line 122:		Line 122:
	\|}		\|}

−	[1] https://sndlib.put.poznan.pl/home.action	+	*[1] https://sndlib.put.poznan.pl/home.action<br>
−	[2] https://github.com/bstabler/TransportationNetworks	+	*[2] https://github.com/bstabler/TransportationNetworks <br>
−	[3] https://www.cvxpy.org/	+	*[3] https://www.cvxpy.org/<br>
−	[4] Scaman, K., Bach, F., Bubeck, S., Massoulié, L., & Lee, Y. T. (2018). Optimal algorithms for non-smooth distributed optimization in networks. Advances in Neural Information Processing Systems, 31.	+	*[4] Scaman, K., Bach, F., Bubeck, S., Massoulié, L., & Lee, Y. T. (2018). Optimal algorithms for non-smooth distributed optimization in networks. Advances in Neural Information Processing Systems, 31.<br>
−	[5] Drori, Y., Sabach, S., & Teboulle, M. (2015). A simple algorithm for a class of nonsmooth convex–concave saddle-point problems. Operations Research Letters, 43(2), 209-214.	+	*[5] Drori, Y., Sabach, S., & Teboulle, M. (2015). A simple algorithm for a class of nonsmooth convex–concave saddle-point problems. Operations Research Letters, 43(2), 209-214.<br>

	\|}		\|}

2024-04-02T15:51:06Z

← Older revision		Revision as of 15:51, 2 April 2024
Line 120:		Line 120:
	#Реализовать методы SSDA, MSDA [4] <br>		#Реализовать методы SSDA, MSDA [4] <br>
	#Реализовать метод PAPC [5]<br>		#Реализовать метод PAPC [5]<br>
		+	\|}

	[1] https://sndlib.put.poznan.pl/home.action		[1] https://sndlib.put.poznan.pl/home.action

2024-04-02T15:50:19Z

2024-02-08T22:23:59Z

Created page with "= <span style="color:red;">Название дисциплины</span> = : '''Квалификация выпускника''': <span style="color:red;">бакалавр/ма..."