Lu, Sitong; Li, Qingna A majorization penalty method for SVM with sparse constraint. (English) Zbl 07716036 Optim. Methods Softw. 38, No. 3, 474-494 (2023). MSC: 90C30 PDFBibTeX XMLCite \textit{S. Lu} and \textit{Q. Li}, Optim. Methods Softw. 38, No. 3, 474--494 (2023; Zbl 07716036) Full Text: DOI arXiv
Quoc Tran-Dinh; Liu, Deyi A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates. (English) Zbl 1515.90101 Optim. Methods Softw. 38, No. 1, 184-217 (2023). MSC: 90C25 PDFBibTeX XMLCite \textit{Quoc Tran-Dinh} and \textit{D. Liu}, Optim. Methods Softw. 38, No. 1, 184--217 (2023; Zbl 1515.90101) Full Text: DOI arXiv
Pang, Li-Ping; Zhang, Ming-Kun; Xiao, Xian-Tao A stochastic approximation method for convex programming with many semidefinite constraints. (English) Zbl 1515.90095 Optim. Methods Softw. 38, No. 1, 34-58 (2023). MSC: 90C22 PDFBibTeX XMLCite \textit{L.-P. Pang} et al., Optim. Methods Softw. 38, No. 1, 34--58 (2023; Zbl 1515.90095) Full Text: DOI
Latafat, Puya; Patrinos, Panagiotis Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays. (English) Zbl 1509.90149 Optim. Methods Softw. 37, No. 6, 2052-2079 (2022). MSC: 90C25 PDFBibTeX XMLCite \textit{P. Latafat} and \textit{P. Patrinos}, Optim. Methods Softw. 37, No. 6, 2052--2079 (2022; Zbl 1509.90149) Full Text: DOI arXiv
Xiao, Nachuan; Liu, Xin; Yuan, Ya-xiang A class of smooth exact penalty function methods for optimization problems with orthogonality constraints. (English) Zbl 1505.65170 Optim. Methods Softw. 37, No. 4, 1205-1241 (2022). MSC: 65F15 65K05 90C06 PDFBibTeX XMLCite \textit{N. Xiao} et al., Optim. Methods Softw. 37, No. 4, 1205--1241 (2022; Zbl 1505.65170) Full Text: DOI
Lei, Jinlong; Shanbhag, Uday V. Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes. (English) Zbl 1501.90056 Optim. Methods Softw. 37, No. 1, 264-294 (2022). MSC: 90C15 90C26 PDFBibTeX XMLCite \textit{J. Lei} and \textit{U. V. Shanbhag}, Optim. Methods Softw. 37, No. 1, 264--294 (2022; Zbl 1501.90056) Full Text: DOI arXiv
Fercoq, Olivier A generic coordinate descent solver for non-smooth convex optimisation. (English) Zbl 1494.90077 Optim. Methods Softw. 36, No. 6, 1202-1222 (2021). MSC: 90C25 PDFBibTeX XMLCite \textit{O. Fercoq}, Optim. Methods Softw. 36, No. 6, 1202--1222 (2021; Zbl 1494.90077) Full Text: DOI arXiv HAL
Stonyakin, Fedor; Tyurin, Alexander; Gasnikov, Alexander; Dvurechensky, Pavel; Agafonov, Artem; Dvinskikh, Darina; Alkousa, Mohammad; Pasechnyuk, Dmitry; Artamonov, Sergei; Piskunova, Victorya Inexact model: a framework for optimization and variational inequalities. (English) Zbl 1489.65089 Optim. Methods Softw. 36, No. 6, 1155-1201 (2021). MSC: 65K05 65K15 90C06 PDFBibTeX XMLCite \textit{F. Stonyakin} et al., Optim. Methods Softw. 36, No. 6, 1155--1201 (2021; Zbl 1489.65089) Full Text: DOI arXiv
Galvan, G.; Lapucci, M.; Levato, T.; Sciandrone, M. An alternating augmented Lagrangian method for constrained nonconvex optimization. (English) Zbl 1441.49030 Optim. Methods Softw. 35, No. 3, 502-520 (2020). MSC: 49M37 65K05 90C30 49M27 90C26 PDFBibTeX XMLCite \textit{G. Galvan} et al., Optim. Methods Softw. 35, No. 3, 502--520 (2020; Zbl 1441.49030) Full Text: DOI
Gao, Wenbo; Goldfarb, Donald; Curtis, Frank E. ADMM for multiaffine constrained optimization. (English) Zbl 1428.90132 Optim. Methods Softw. 35, No. 2, 257-303 (2020). MSC: 90C26 90C30 PDFBibTeX XMLCite \textit{W. Gao} et al., Optim. Methods Softw. 35, No. 2, 257--303 (2020; Zbl 1428.90132) Full Text: DOI arXiv
van Ackooij, W.; de Oliveira, Wellington Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies. (English) Zbl 1417.49016 Optim. Methods Softw. 34, No. 4, 890-920 (2019); addendum ibid. 37, No. 6, 2241-2250 (2022). MSC: 49J52 49J53 90C25 90C26 90C30 90C46 PDFBibTeX XMLCite \textit{W. van Ackooij} and \textit{W. de Oliveira}, Optim. Methods Softw. 34, No. 4, 890--920 (2019; Zbl 1417.49016) Full Text: DOI
Iiduka, H. Two stochastic optimization algorithms for convex optimization with fixed point constraints. (English) Zbl 1461.65157 Optim. Methods Softw. 34, No. 4, 731-757 (2019). MSC: 65K05 90C15 90C25 PDFBibTeX XMLCite \textit{H. Iiduka}, Optim. Methods Softw. 34, No. 4, 731--757 (2019; Zbl 1461.65157) Full Text: DOI arXiv
Diamond, S.; Takapoui, R.; Boyd, S. A general system for heuristic minimization of convex functions over non-convex sets. (English) Zbl 1386.90182 Optim. Methods Softw. 33, No. 1, 165-193 (2018). MSC: 90C59 90C26 90C25 PDFBibTeX XMLCite \textit{S. Diamond} et al., Optim. Methods Softw. 33, No. 1, 165--193 (2018; Zbl 1386.90182) Full Text: DOI arXiv
Qin, Zhiwei (Tony); Goldfarb, Donald; Ma, Shiqian An alternating direction method for total variation denoising. (English) Zbl 1326.94024 Optim. Methods Softw. 30, No. 3, 594-615 (2015). MSC: 94A08 90C90 90C25 PDFBibTeX XMLCite \textit{Z. Qin} et al., Optim. Methods Softw. 30, No. 3, 594--615 (2015; Zbl 1326.94024) Full Text: DOI arXiv
Lu, Zhaosong; Zhang, Yong; Li, Xiaorui Penalty decomposition methods for rank minimization. (English) Zbl 1323.65070 Optim. Methods Softw. 30, No. 3, 531-558 (2015). Reviewer: Hang Lau (Montréal) MSC: 65K05 15A83 90C30 15A03 PDFBibTeX XMLCite \textit{Z. Lu} et al., Optim. Methods Softw. 30, No. 3, 531--558 (2015; Zbl 1323.65070) Full Text: DOI arXiv