ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
Efficient primal–dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
Multidimensional Systems and Signal Processing
◽
10.1007/s11045-018-0615-z
◽
2018
◽
Vol 30
(3)
◽
pp. 1531-1544
Author(s):
Meng Wen
◽
Yuchao Tang
◽
Angang Cui
◽
Jigen Peng
Keyword(s):
Fixed Point
◽
Convex Optimization
◽
Optimization Problems
◽
Convex Optimization Problems
◽
Fixed Point Algorithms
◽
Primal Dual
Download Full-text
Related Documents
Cited By
References
Coupled-decompositions: exploiting primal–dual interactions in convex optimization problems
EURASIP Journal on Advances in Signal Processing
◽
10.1186/1687-6180-2013-41
◽
2013
◽
Vol 2013
(1)
◽
Author(s):
Antoni Morell
◽
José López Vicario
◽
Gonzalo Seco-Granados
Keyword(s):
Convex Optimization
◽
Optimization Problems
◽
Convex Optimization Problems
◽
Primal Dual
Download Full-text
On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
Optimization
◽
10.1080/02331934.2014.966306
◽
2014
◽
Vol 64
(1)
◽
pp. 5-23
◽
Cited By ~ 10
Author(s):
Radu Ioan Boţ
◽
Ernö Robert Csetnek
Keyword(s):
Convex Optimization
◽
Convergence Rate
◽
Optimization Problems
◽
Splitting Algorithm
◽
Convex Optimization Problems
◽
Primal Dual
Download Full-text
Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
Numerical Algorithms
◽
10.1007/s11075-021-01246-y
◽
2022
◽
Author(s):
Xin He
◽
Rong Hu
◽
Ya-Ping Fang
Keyword(s):
Convex Optimization
◽
Optimization Problems
◽
Convex Optimization Problems
◽
Constrained Convex Optimization
◽
Linear Equality
◽
Dual Methods
◽
Primal Dual
Download Full-text
Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic Form
Foundations of Computational Mathematics
◽
10.1007/s002080010009
◽
2001
◽
Vol 1
(3)
◽
pp. 229-254
◽
Cited By ~ 13
Author(s):
Levent Tunçel
Keyword(s):
Convex Optimization
◽
Interior Point
◽
Interior Point Methods
◽
Optimization Problems
◽
Convex Optimization Problems
◽
Primal Dual
◽
Conic Form
Download Full-text
Primal-dual incremental gradient method for nonsmooth and convex optimization problems
Optimization Letters
◽
10.1007/s11590-021-01752-x
◽
2021
◽
Author(s):
Afrooz Jalilzadeh
Keyword(s):
Convex Optimization
◽
Gradient Method
◽
Optimization Problems
◽
Convex Optimization Problems
◽
Primal Dual
Download Full-text
Primal-dual subgradient method for constrained convex optimization problems
Optimization Letters
◽
10.1007/s11590-021-01728-x
◽
2021
◽
Author(s):
Michael R. Metel
◽
Akiko Takeda
Keyword(s):
Convex Optimization
◽
Optimization Problems
◽
Subgradient Method
◽
Convex Optimization Problems
◽
Constrained Convex Optimization
◽
Primal Dual
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
◽
Primal Dual
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
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close