scholarly journals Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations

2012 ◽  
Vol 22 (3) ◽  
pp. 987-1008 ◽  
Author(s):  
Guanglu Zhou ◽  
Louis Caccetta ◽  
Kok Lay Teo ◽  
Soon-Yi Wu
Keyword(s):  
Convex Programming ◽  
Polynomial Optimization ◽  
Nonnegative Polynomial

Mixed H2/H∞ control via convex programming

1991 ◽  
Author(s):  
Mario A. Rotea ◽  
Pramod P. Khargonekar
Keyword(s):  
Convex Programming

scholarly journals Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Darina Dvinskikh ◽  
Alexander Gasnikov
Keyword(s):  
Convex Optimization ◽  
Inverse Problems ◽  
Convex Programming ◽  
Data Science ◽  
Optimization Problems ◽  
Stochastic Gradient ◽  
Logarithmic Factor ◽  
Accelerated Methods ◽  
Convex Optimization Problems ◽  
Primal And Dual

Abstract We introduce primal and dual stochastic gradient oracle methods for decentralized convex optimization problems. Both for primal and dual oracles, the proposed methods are optimal in terms of the number of communication steps. However, for all classes of the objective, the optimality in terms of the number of oracle calls per node takes place only up to a logarithmic factor and the notion of smoothness. By using mini-batching technique, we show that the proposed methods with stochastic oracle can be additionally parallelized at each node. The considered algorithms can be applied to many data science problems and inverse problems.

Sign in / Sign up

Export Citation Format

Share Document