Fetching the paper…
Reading the bibliography…
In this paper, we study the convergence rate of the DCA (Difference-of-Convex Algorithm), also known as the convex-concave procedure, with two different termination criteria that are suitable for smooth and nonsmooth decompositions respectively.
Joki K, Bagirov AM, Karmitsa N, Mäkelä MM, Taheri S (2018) Double bundle method for finding Clarke stationary points in nonsmooth DC programming. SIAM Journal on Optimization. 28(2):1892-1919. https://doi.org/10.1137/16M1115733
1919
Earlier work this paper cites.
Hartman P (1959) On functions representable as a difference of convex functions. Pacific Journal of Mathematics. 9(3):707-713
1959
Earlier work this paper cites.
Rockafellar RT (1970) Convex analysis. Princeton university press, Princeton
1970
Earlier work this paper cites.
Toland JF (1979) A duality principle for non-convex optimisation and the calculus of variations. Archive for Rational Mechanics and Analysis. 71(1):41-61. https://doi.org/10.1007/BF00250669
1979
Earlier work this paper cites.
Hiriart-Urruty JB (1985) Generalized differentiability/duality and optimization for problems dealing with differences of convex functions. In: Ponstein J (eds) Convexity and duality in optimization. vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45610-7_3
1985
Earlier work this paper cites.
Melzer D (1986) On the expressibility of piecewise-linear continuous functions as the difference of two piecewise-linear convex functions. In: Demyanov VF, Dixon LCW (eds) Quasidifferential Calculus. Mathematical Programming Studies, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121142
1986
Earlier work this paper cites.
Tao PD, An LTH (1997) Convex analysis approach to DC programming: theory, algorithms and applications. Acta mathematica vietnamica. 22(1):289-355
1997
Earlier work this paper cites.
Chen PC, Hansen P, Jaumard B, Tuy H (1998) Solution of the multisource Weber and conditional Weber problems by D.C. programming. Operations Research. 46(4):548-562. https://doi.org/10.1287/opre.46.4.548
1998
Earlier work this paper cites.
Tuy H (1998) Convex analysis and global optimization. Springer, Dordrecht
1998
Earlier work this paper cites.
Holmberg K, Tuy H (1999) A production-transportation problem with stochastic demand and concave production costs. Mathematical programming. 85(1):157-179. https://doi.org/10.1007/s101070050050
1999
Earlier work this paper cites.
Horst R, Thoai NV (1999) DC programming: overview. Journal of Optimization Theory and Applications. 103(1):1-43. https://doi.org/10.1023/A:1021765131316
1999
Earlier work this paper cites.
An LTH, Tao PD (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of operations research. 133(1-4):23-46. https://doi.org/10.1007/s10479-004-5022-1
2005
Earlier work this paper cites.
Bolte J, Daniilidis A, Lewis A (2006) The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems. SIAM Journal on Optimization. 17(4):1205-1223. https://doi.org/10.1137/050644641
2006
Earlier work this paper cites.
Gasso G, Rakotomamonjy A, Canu S (2009) Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Transactions on Signal Processing. 57(12):4686-4698. https://doi.org/10.1109/TSP.2009.2026004
2009
Earlier work this paper cites.
Rockafellar RT, Wets RJB (2009) Variational analysis. Springer Science & Business Media, New York
2009
Earlier work this paper cites.
Astorino A, Fuduli A, Gaudioso M (2012) Margin maximization in spherical separation. Computational Optimization and Applications. 53(2):301-322. https://doi.org/10.1007/s10589-012-9486-7
2012
Cited alongside, same era.
Yen IE, Peng N, Wang PW, Lin SD (2012) On convergence rate of concave-convex procedure. In: Proceedings of the NIPS 2012 Optimization Workshop. pp. 31-35
2012
Cited alongside, same era.
Alvarado A, Scutari G, Pang JS (2014) A new decomposition method for multiuser DC-programming and its applications. IEEE Transactions on Signal Processing. 62(11):2984-2998. https://doi.org/10.1109/TSP.2014.2315167
2014
Cited alongside, same era.
Bolte J, Sabach S, Teboulle M (2014) Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Mathematical Programming. 146(1):459-494. https://doi.org/10.1007/s10107-013-0701-9
2014
Cited alongside, same era.
Taylor AB, Hendrickx JM, Glineur F (2017) Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Mathematical Programming. 161(1-2):307-345. https://doi.org/10.1007/s10107-016-1009-3
2017
Later among the works it cites.
Taylor AB, Hendrickx JM, Glineur F (2017) Exact worst-case performance of first-order methods for composite convex optimization. SIAM Journal on Optimization. 27(3):1283-1313. https://doi.org/10.1137/16M108104X
2017
Later among the works it cites.
Ahmadi AA, Hall G (2018) DC decomposition of nonconvex polynomials with algebraic techniques. Mathematical Programming. 169(1):69-94. https://doi.org/10.1007/s10107-017-1144-5
2018
Later among the works it cites.
Gotoh Jy, Takeda A, Tono K (2018) DC formulations and algorithms for sparse optimization problems. Mathematical Programming. 169(1):141-176. https://doi.org/10.1007/s10107-017-1181-0
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Drori Y, Teboulle M (2014) Performance of first-order methods for smooth convex minimization: a novel approach. Mathematical Programming. 145(1):451-482. https://doi.org/10.1007/s10107-013-0653-0
2014
Cited alongside, same era.
Bagirov AM, Taheri S, Ugon J (2016) Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recognition. 53:12-24. https://doi.org/10.1016/j.patcog.2015.11.011
2015
Cited alongside, same era.
Lou Y, Zeng T, Osher S, Xin J (2015) A weighted difference of anisotropic and isotropic total variation model for image processing. SIAM Journal on Imaging Sciences. 8(3):1798-1823. https://doi.org/10.1137/14098435X
2015
Cited alongside, same era.
Karimi H, Nutini J, Schmidt M (2016) Linear convergence of gradient and proximal-gradient methods under the Polyak-Łojasiewicz condition. In: Frasconi P, Landwehr N, Manco G, Vreeken J (eds) Machine Learning and Knowledge Discovery in Databases. vol 9851. Springer, Cham. https://doi.org/10.1007/978-3-319-46128-1_50
2016
Cited alongside, same era.
Lipp T, Boyd S (2016) Variations and extension of the convex–concave procedure. Optimization and Engineering. 17(2):263-287. https://doi.org/10.1007/s11081-015-9294-x
2016
Cited alongside, same era.
Pang JS, Razaviyayn M, Alvarado A (2017) Computing B-stationary points of nonsmooth DC programs. Mathematics of Operations Research. 42(1):95-118. https://doi.org/10.1287/moor.2016.0795
2016
Cited alongside, same era.
Bagirov AM, Ugon, J (2018) Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms. Optimization methods and software. 33(1):194-219. https://doi.org/10.1080/10556788.2017.1371717
2017
Cited alongside, same era.
Beck A (2017) First-order methods in optimization. SIAM, Philadelphia
2017
Cited alongside, same era.
Le Thi HA, Dinh TP, Pham DT (2018) Convergence analysis of difference-of-convex algorithm with subanalytic data. Journal of Optimization Theory and Applications. 179(1):103-126. https://doi.org/10.1007/s10957-018-1345-y
2018
Later among the works it cites.
Le Thi HA, Dinh TP (2018) DC programming and DCA: thirty years of developments. Mathematical Programming. 169(1):5-68. https://doi.org/10.1007/s10107-018-1235-y
2018
Later among the works it cites.
Nesterov Y (2018) Lectures on convex optimization. Springer, Cham
2018
Later among the works it cites.
Ghadimi S (2019) Conditional gradient type methods for composite nonlinear and stochastic optimization. Mathematical Programming. 173(1):431-464. https://doi.org/10.1007/s10107-017-1225-5
2019
Later among the works it cites.
Lu Z, Zhou Z (2019) Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming. SIAM Journal on Optimization. 29(4):2725-2752. https://doi.org/10.1137/18M1214342
2019
Later among the works it cites.
Lu Z, Zhou Z, Sun Z (2019) Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Mathematical Programming. 176(1):369-401. https://doi.org/10.1007/s10107-018-1318-9
2019
Later among the works it cites.
Le Thi HA, Phan DN, Dinh TP (2021) DCA based approaches for bi-level variable selection and application for estimate multiple sparse covariance matrices. Neurocomputing. 466:162-177. https://doi.org/10.1016/j.neucom.2021.09.039
2021
Closest in time.
Abbaszadehpeivasti H, De Klerk E, Zamani M (2022) The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions. Optimization Letters. 16(6):1649-1661. https://doi.org/10.1007/s11590-021-01821-1
2022
Closest in time.
2022
Closest in time.
Sun K, Sun XA (2022) Algorithms for Difference-of-Convex Programs Based on Difference-of-Moreau-Envelopes Smoothing. INFORMS Journal on Optimization. https://doi.org/10.1287/ijoo.2022.0087
2022
Closest in time.
De Klerk E, Glineur F, Taylor AB (2020) Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation. SIAM Journal on Optimization. 30(3):2053-2082. https://doi.org/10.1137/19M1281368
2082
Closest in time.