167 related articles for article (PubMed ID: 36141164)
21. A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators.
Li Z; Ding S; Li Y
Neural Comput; 2015 Sep; 27(9):1951-82. PubMed ID: 26161819
[TBL] [Abstract][Full Text] [Related]
22. Distributed Optimization for Graph Matching.
Van Tran Q; Sun Z; D O Anderson B; Ahn HS
IEEE Trans Cybern; 2023 Aug; 53(8):4815-4828. PubMed ID: 35081034
[TBL] [Abstract][Full Text] [Related]
23. Nonsmooth Optimization-Based Model and Algorithm for Semisupervised Clustering.
Bagirov AM; Taheri S; Bai F; Zheng F
IEEE Trans Neural Netw Learn Syst; 2023 Sep; 34(9):5517-5530. PubMed ID: 34851837
[TBL] [Abstract][Full Text] [Related]
24. Neural network for nonsmooth, nonconvex constrained minimization via smooth approximation.
Bian W; Chen X
IEEE Trans Neural Netw Learn Syst; 2014 Mar; 25(3):545-56. PubMed ID: 24807450
[TBL] [Abstract][Full Text] [Related]
25. A one-layer projection neural network for nonsmooth optimization subject to linear equalities and bound constraints.
Liu Q; Wang J
IEEE Trans Neural Netw Learn Syst; 2013 May; 24(5):812-24. PubMed ID: 24808430
[TBL] [Abstract][Full Text] [Related]
26. A primal-dual algorithm framework for convex saddle-point optimization.
Zhang B; Zhu Z
J Inequal Appl; 2017; 2017(1):267. PubMed ID: 29104405
[TBL] [Abstract][Full Text] [Related]
27. Distributed Algorithm Design for Nonsmooth Resource Allocation Problems.
Deng Z; Nian X; Hu C
IEEE Trans Cybern; 2020 Jul; 50(7):3208-3217. PubMed ID: 30872253
[TBL] [Abstract][Full Text] [Related]
28. A one-layer recurrent neural network for constrained nonsmooth optimization.
Liu Q; Wang J
IEEE Trans Syst Man Cybern B Cybern; 2011 Oct; 41(5):1323-33. PubMed ID: 21536534
[TBL] [Abstract][Full Text] [Related]
29. Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates.
Boţ RI; Csetnek ER; Nguyen DK
Math Program; 2023; 200(1):147-197. PubMed ID: 37215306
[TBL] [Abstract][Full Text] [Related]
30. On a Monotone Scheme for Nonconvex Nonsmooth Optimization with Applications to Fracture Mechanics.
Ghilli D; Kunisch K
J Optim Theory Appl; 2019; 183(2):609-641. PubMed ID: 31975742
[TBL] [Abstract][Full Text] [Related]
31. Distributed Primal-Dual Subgradient Method for Multiagent Optimization via Consensus Algorithms.
Deming Yuan ; Shengyuan Xu ; Huanyu Zhao
IEEE Trans Syst Man Cybern B Cybern; 2011 Dec; 41(6):1715-24. PubMed ID: 21824853
[TBL] [Abstract][Full Text] [Related]
32. An Adaptive Primal-Dual Subgradient Algorithm for Online Distributed Constrained Optimization.
Yuan D; Ho DWC; Jiang GP
IEEE Trans Cybern; 2018 Nov; 48(11):3045-3055. PubMed ID: 28991757
[TBL] [Abstract][Full Text] [Related]
33. Finite-Time Consensus of Opinion Dynamics and its Applications to Distributed Optimization Over Digraph.
Shi X; Cao J; Wen G; Perc M
IEEE Trans Cybern; 2019 Oct; 49(10):3767-3779. PubMed ID: 30010607
[TBL] [Abstract][Full Text] [Related]
34. A general double-proximal gradient algorithm for d.c. programming.
Banert S; Boț RI
Math Program; 2019; 178(1):301-326. PubMed ID: 31762494
[TBL] [Abstract][Full Text] [Related]
35. Neural network for constrained nonsmooth optimization using Tikhonov regularization.
Qin S; Fan D; Wu G; Zhao L
Neural Netw; 2015 Mar; 63():272-81. PubMed ID: 25590563
[TBL] [Abstract][Full Text] [Related]
36. The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints.
Bitterlich S; Boţ RI; Csetnek ER; Wanka G
J Optim Theory Appl; 2019; 182(1):110-132. PubMed ID: 31258180
[TBL] [Abstract][Full Text] [Related]
37. Inertial proximal alternating minimization for nonconvex and nonsmooth problems.
Zhang Y; He S
J Inequal Appl; 2017; 2017(1):232. PubMed ID: 29026279
[TBL] [Abstract][Full Text] [Related]
38. Adaptive Neurodynamic Approach to Multiple Constrained Distributed Resource Allocation.
Luan L; Qin S
IEEE Trans Neural Netw Learn Syst; 2023 Jun; PP():. PubMed ID: 37310826
[TBL] [Abstract][Full Text] [Related]
39. An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function.
Boţ RI; Csetnek ER; Sedlmayer M
Comput Optim Appl; 2023; 86(3):925-966. PubMed ID: 37969869
[TBL] [Abstract][Full Text] [Related]
40. Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces.
Boţ RI; Csetnek ER; Meier D
Optim Methods Softw; 2019; 34(3):489-514. PubMed ID: 31057305
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
