Separable Convex Optimization Problems with Linear Ascending Constraints

SIAM Journal on Optimization ◽

10.1137/07069729x ◽

2010 ◽

Vol 20 (3) ◽

pp. 1185-1204 ◽

Author(s):

Arun Padakandla ◽

Rajesh Sundaresan

Keyword(s):

Convex Optimization ◽

Optimization Problems ◽

Convex Optimization Problems ◽

Separable Convex Optimization

Download Full-text

Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems

Computational Optimization and Applications ◽

10.1007/s10589-012-9515-6 ◽

2012 ◽

Vol 55 (1) ◽

pp. 75-111 ◽

Author(s):

Quoc Tran Dinh ◽

Carlo Savorgnan ◽

Moritz Diehl

Keyword(s):

Convex Optimization ◽

Large Scale ◽

Optimization Problems ◽

Smoothing Technique ◽

Lagrangian Decomposition ◽

Convex Optimization Problems ◽

Separable Convex Optimization

Download Full-text

On the Distributed Method of Multipliers for Separable Convex Optimization Problems

IEEE Transactions on Signal and Information Processing over Networks ◽

10.1109/tsipn.2019.2901649 ◽

2019 ◽

Vol 5 (3) ◽

pp. 495-510 ◽

Author(s):

Thomas Sherson ◽

Richard Heusdens ◽

W. Bastiaan Kleijn

Keyword(s):

Convex Optimization ◽

Optimization Problems ◽

Method Of Multipliers ◽

Convex Optimization Problems ◽

Separable Convex Optimization ◽

Distributed Method

Download Full-text

Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces

Computational Optimization and Applications ◽

10.1007/s10589-019-00087-9 ◽

2019 ◽

Vol 73 (3) ◽

pp. 755-790

Author(s):

Eike Börgens ◽

Christian Kanzow

Keyword(s):

Convex Optimization ◽

Hilbert Spaces ◽

Optimization Problems ◽

Convex Optimization Problems ◽

Separable Convex Optimization

Download Full-text

A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints

SIAM Journal on Optimization ◽

10.1137/14098524x ◽

2016 ◽

Vol 26 (1) ◽

pp. 856-889 ◽

Author(s):

Sergei Chubanov

Keyword(s):

Convex Optimization ◽

Polynomial Time ◽

Optimization Problems ◽

Linear Constraints ◽

Descent Method ◽

Convex Optimization Problems ◽

Separable Convex Optimization

Download Full-text

The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints

Journal of Optimization Theory and Applications ◽

10.1007/s10957-018-01454-y ◽

2018 ◽

Vol 182 (1) ◽

pp. 110-132 ◽

Author(s):

Sandy Bitterlich ◽

Radu Ioan Boţ ◽

Ernö Robert Csetnek ◽

Gert Wanka

Keyword(s):

Convex Optimization ◽

Optimization Problems ◽

Linear Constraints ◽

Alternating Minimization ◽

Minimization Algorithm ◽

Convex Optimization Problems ◽

Alternating Minimization Algorithm ◽

Separable Convex Optimization

Download Full-text

A Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints

Numerical Functional Analysis and Optimization ◽

10.1080/01630563.2020.1845730 ◽

2021 ◽

pp. 1-38

Author(s):

Sandy Bitterlich ◽

Ernö Robert Csetnek ◽

Gert Wanka

Keyword(s):

Convex Optimization ◽

Optimization Problems ◽

Linear Constraints ◽

Convex Optimization Problems ◽

Dynamical Approach ◽

Separable Convex Optimization

Download Full-text

Convergence Rates of Inertial Primal-Dual Dynamical Methods for Separable Convex Optimization Problems

SIAM Journal on Control and Optimization ◽

10.1137/20m1355379 ◽

2021 ◽

Vol 59 (5) ◽

pp. 3278-3301

Author(s):

Xin He ◽

Rong Hu ◽

Ya Ping Fang

Keyword(s):

Convex Optimization ◽

Convergence Rates ◽

Optimization Problems ◽

Convex Optimization Problems ◽

Separable Convex Optimization ◽

Download Full-text

Gradient-Free Two-Point Methods for Solving Stochastic Nonsmooth Convex Optimization Problems with Small Non-Random Noises

Автоматика и телемеханика ◽

10.31857/s000523100001245-3 ◽

2018 ◽

pp. 38-49

Author(s):

Anastasya Bayandina ◽

◽

Aleksandr Gasnikov ◽

Anastasya Lagunovskaya ◽

◽

...

Keyword(s):

Convex Optimization ◽

Optimization Problems ◽

Nonsmooth Convex Optimization ◽

Convex Optimization Problems

Download Full-text

Status determination by interior-point methods for convex optimization problems in domain-driven form

Mathematical Programming ◽

10.1007/s10107-021-01663-w ◽

2021 ◽

Author(s):

Mehdi Karimi ◽

Levent Tunçel

Keyword(s):

Convex Optimization ◽

Interior Point ◽

Interior Point Methods ◽

Optimization Problems ◽

Convex Optimization Problems

Download Full-text

On the transient growth of Nesterov’s accelerated method for strongly convex optimization problems

2020 59th IEEE Conference on Decision and Control (CDC) ◽

10.1109/cdc42340.2020.9304412 ◽

2020 ◽

Author(s):

Samantha Samuelson ◽

Hesameddin Mohammadi ◽

Mihailo R. Jovanovic

Keyword(s):

Convex Optimization ◽

Optimization Problems ◽

Transient Growth ◽

Strongly Convex ◽

Convex Optimization Problems ◽

Strongly Convex Optimization

Download Full-text