139 related articles for article (PubMed ID: 37155414)
21. An incremental mirror descent subgradient algorithm with random sweeping and proximal step.
Boţ RI; Böhm A
Optimization; 2019; 68(1):33-50. PubMed ID: 30828224
[TBL] [Abstract][Full Text] [Related]
22. Solving minimum distance problems with convex or concave bodies using combinatorial global optimization algorithms.
Carretero JA; Nahon MA
IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1144-55. PubMed ID: 16366241
[TBL] [Abstract][Full Text] [Related]
23. Neural network for nonsmooth pseudoconvex optimization with general convex constraints.
Bian W; Ma L; Qin S; Xue X
Neural Netw; 2018 May; 101():1-14. PubMed ID: 29471133
[TBL] [Abstract][Full Text] [Related]
24. The Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Space.
Censor Y; Gibali A; Reich S
J Optim Theory Appl; 2011 Feb; 148(2):318-335. PubMed ID: 21490879
[TBL] [Abstract][Full Text] [Related]
25. Decentralized Primal-Dual Proximal Operator Algorithm for Constrained Nonsmooth Composite Optimization Problems over Networks.
Feng L; Ran L; Meng G; Tang J; Ding W; Li H
Entropy (Basel); 2022 Sep; 24(9):. PubMed ID: 36141164
[TBL] [Abstract][Full Text] [Related]
26. Forward-reflected-backward method with variance reduction.
Alacaoglu A; Malitsky Y; Cevher V
Comput Optim Appl; 2021; 80(2):321-346. PubMed ID: 34720428
[TBL] [Abstract][Full Text] [Related]
27. 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]
28. Viscosity iterative algorithm for the zero point of monotone mappings in Banach spaces.
Tang Y
J Inequal Appl; 2018; 2018(1):254. PubMed ID: 30839705
[TBL] [Abstract][Full Text] [Related]
29. Novel projection neurodynamic approaches for constrained convex optimization.
Zhao Y; Liao X; He X
Neural Netw; 2022 Jun; 150():336-349. PubMed ID: 35344705
[TBL] [Abstract][Full Text] [Related]
30. Proximal extrapolated gradient methods for variational inequalities.
Malitsky Y
Optim Methods Softw; 2018; 33(1):140-164. PubMed ID: 29348705
[TBL] [Abstract][Full Text] [Related]
31. A Generalized Hopfield Network for Nonsmooth Constrained Convex Optimization: Lie Derivative Approach.
Li C; Yu X; Huang T; Chen G; He X
IEEE Trans Neural Netw Learn Syst; 2016 Feb; 27(2):308-21. PubMed ID: 26595931
[TBL] [Abstract][Full Text] [Related]
32. A fast continuous time approach with time scaling for nonsmooth convex optimization.
Boţ RI; Karapetyants MA
Adv Contin Discret Model; 2022; 2022(1):73. PubMed ID: 36540365
[TBL] [Abstract][Full Text] [Related]
33. An existence-uniqueness theorem and alternating contraction projection methods for inverse variational inequalities.
He S; Dong QL
J Inequal Appl; 2018; 2018(1):351. PubMed ID: 30839866
[TBL] [Abstract][Full Text] [Related]
34. A Projection Neural Network to Nonsmooth Constrained Pseudoconvex Optimization.
Liu J; Liao X
IEEE Trans Neural Netw Learn Syst; 2023 Apr; 34(4):2001-2015. PubMed ID: 34464277
[TBL] [Abstract][Full Text] [Related]
35. A neurodynamic approach for nonsmooth optimal power consumption of intelligent and connected vehicles.
Liu J; Liao X; Dong JS; Mansoori A
Neural Netw; 2023 Apr; 161():693-707. PubMed ID: 36848825
[TBL] [Abstract][Full Text] [Related]
36. A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems.
Gong P; Zhang C; Lu Z; Huang JZ; Ye J
JMLR Workshop Conf Proc; 2013; 28(2):37-45. PubMed ID: 25285330
[TBL] [Abstract][Full Text] [Related]
37. A two-layer recurrent neural network for nonsmooth convex optimization problems.
Qin S; Xue X
IEEE Trans Neural Netw Learn Syst; 2015 Jun; 26(6):1149-60. PubMed ID: 25051563
[TBL] [Abstract][Full Text] [Related]
38. Adaptive Restart of the Optimized Gradient Method for Convex Optimization.
Kim D; Fessler JA
J Optim Theory Appl; 2018 Jul; 178(1):240-263. PubMed ID: 36341472
[TBL] [Abstract][Full Text] [Related]
39. Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections.
Combettes PL
IEEE Trans Image Process; 1997; 6(4):493-506. PubMed ID: 18282944
[TBL] [Abstract][Full Text] [Related]
40. Implementable tensor methods in unconstrained convex optimization.
Nesterov Y
Math Program; 2021; 186(1):157-183. PubMed ID: 33627889
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
