Loading…
Loading…
Loading…
A proximal difference-of-convex algorithm with extrapolation
Wen, Bo, Chen, Xiaojun, Pong, Ting Kei
Published in Computational optimization and applications (01.03.2018)
Published in Computational optimization and applications (01.03.2018)
Get full text
Journal Article
Loading…
An efficient augmented Lagrangian method with applications to total variation minimization
Li, Chengbo, Yin, Wotao, Jiang, Hong, Zhang, Yin
Published in Computational optimization and applications (01.12.2013)
Published in Computational optimization and applications (01.12.2013)
Get full text
Journal Article
Loading…
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
Qin, Xiaolong, An, Nguyen Thai
Published in Computational optimization and applications (01.12.2019)
Published in Computational optimization and applications (01.12.2019)
Get full text
Journal Article
Loading…
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
Jiang, Bo, Lin, Tianyi, Ma, Shiqian, Zhang, Shuzhong
Published in Computational optimization and applications (01.01.2019)
Published in Computational optimization and applications (01.01.2019)
Get full text
Journal Article
Loading…
Forward–backward quasi-Newton methods for nonsmooth optimization problems
Stella, Lorenzo, Themelis, Andreas, Patrinos, Panagiotis
Published in Computational optimization and applications (01.07.2017)
Published in Computational optimization and applications (01.07.2017)
Get full text
Journal Article
Loading…
Loading…
Loading…
Loading…
Loading…
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
Hanzely, Filip, Richtárik, Peter, Xiao, Lin
Published in Computational optimization and applications (01.06.2021)
Published in Computational optimization and applications (01.06.2021)
Get full text
Journal Article
Loading…
Modified hybrid projection methods for finding common solutions to variational inequality problems
Van Hieu, Dang, Anh, Pham Ky, Muu, Le Dung
Published in Computational optimization and applications (01.01.2017)
Published in Computational optimization and applications (01.01.2017)
Get full text
Journal Article
Loading…
An inexact accelerated stochastic ADMM for separable convex optimization
Bai, Jianchao, Hager, William W., Zhang, Hongchao
Published in Computational optimization and applications (01.03.2022)
Published in Computational optimization and applications (01.03.2022)
Get full text
Journal Article
Loading…
The Levenberg–Marquardt method: an overview of modern convergence theories and more
Fischer, Andreas, Izmailov, Alexey F., Solodov, Mikhail V.
Published in Computational optimization and applications (01.09.2024)
Published in Computational optimization and applications (01.09.2024)
Get full text
Journal Article
Loading…
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
Lin, Qihang, Ma, Runchao, Xu, Yangyang
Published in Computational optimization and applications (01.05.2022)
Published in Computational optimization and applications (01.05.2022)
Get full text
Journal Article
Loading…
A survey on multi-objective evolutionary algorithms for many-objective problems
von Lücken, Christian, Barán, Benjamín, Brizuela, Carlos
Published in Computational optimization and applications (01.07.2014)
Published in Computational optimization and applications (01.07.2014)
Get full text
Journal Article
Loading…
Loading…
Loading…
Optimally linearizing the alternating direction method of multipliers for convex programming
He, Bingsheng, Ma, Feng, Yuan, Xiaoming
Published in Computational optimization and applications (01.03.2020)
Published in Computational optimization and applications (01.03.2020)
Get full text
Journal Article