Fetching the paper…
Reading the bibliography…
This paper proposes and analyzes a proximal augmented Lagrangian (NL-IAPIAL) method for solving smooth nonconvex composite optimization problems with nonlinear $\cal K$-convex constraints, i.e., the constraints are convex with respect to the order given by a closed convex cone $\cal K$.
1906
Earlier work this paper cites.
1908
Earlier work this paper cites.
1908
Earlier work this paper cites.
1908
Earlier work this paper cites.
Hiriart-Urruty J, Lemarechal C (1993) Convex Analysis and Minimization Algorithms I (Berlin: Springer)
1993
Earlier work this paper cites.
Rockafellar RT, Wets RJB (1998) Variational analysis (Berlin: Springer), ISBN 3-540-62772-3, URL http://opac.inria.fr/record=b1093869
1998
Earlier work this paper cites.
Li Z, Xu Y (2020) Augmented Lagrangian based first-order methods for convex and nonconvex programs: nonergodic convergence and iteration complexity. arXiv e-prints arXiv–2003
2003
Earlier work this paper cites.
Dattorro M, Dattorro J (2005) Convex Optimization & Euclidean Distance Geometry (Meeboo Publishing)
2005
Earlier work this paper cites.
2006
Earlier work this paper cites.
Nocedal J, Wright S (2006) Numerical optimization (Springer Science & Business Media)
2006
Earlier work this paper cites.
2006
Earlier work this paper cites.
2006
Earlier work this paper cites.
2007
Earlier work this paper cites.
2008
Cited alongside, same era.
Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1):183–202
2009
Cited alongside, same era.
Aybat N, Iyengar G (2011) A first-order smoothed penalty method for compressed sensing. SIAM J. Optim. 21(1):287–313
2011
Cited alongside, same era.
Aybat N, Iyengar G (2012) A first-order augmented Lagrangian method for compressed sensing. SIAM J. Optim. 22(2):429–459, URL http://dx.doi.org/10.1137/100786721
2012
Cited alongside, same era.
Nesterov Y (2012) Gradient methods for minimizing composite functions. Math. Program. 1–37
2012
Beck A (2017) First-order methods in optimization (SIAM)
2017
Later among the works it cites.
Necoara I, Patrascu A, Glineur F (2017) Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Methods Softw. 1–31
2017
Later among the works it cites.
Patrascu A, Necoara I, Tran-Dinh Q (2017) Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization. Optim. Lett. 11(3):609–626
2017
Later among the works it cites.
Carmon Y, Duchi JC, Hinder O, Sidford A (2018) Accelerated methods for nonconvex optimization. SIAM J. Optim. 28(2):1751–1772, URL http://dx.doi.org/10.1137/17M1114296
2018
Later among the works it cites.
Florea MI, Vorobyov SA (2018) An accelerated composite gradient method for large-scale composite objective problems. IEEE Transactions on Signal Processing 67(2):444–459
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Fletcher R (2013) Practical methods of optimization (John Wiley & Sons)
2013
Cited alongside, same era.
Lan G, Monteiro RDC (2013) Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138(1):115–139
2013
Cited alongside, same era.
Lin Q, Xiao L (2014) An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization. Proc. 31st Int. Conf. Mach. Learn. 32:73–81
2014
Cited alongside, same era.
Parikh N, Boyd S (2014) Proximal algorithms. Foundations and Trends in optimization 1(3):127–239
2014
Cited alongside, same era.
Bertsekas D (2016) Nonlinear programming (Athena Scientific), "3" edition
2016
Cited alongside, same era.
Ghadimi S, Lan G (2016) Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156:59–99, ISSN 1436-4646
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Later among the works it cites.
2018
Later among the works it cites.
Hajinezhad D, Hong M (2019) Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization. Math. Program. 176:207–245
2019
Later among the works it cites.
Jiang B, Lin T, Ma S, Zhang S (2019) Structured nonconvex and nonsmooth optimization algorithms and iteration complexity analysis. Comput. Optim. Appl. 72(3):115–157
2019
Later among the works it cites.
Liu Y, Liu X, Ma S (2019) On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming. Math. Oper. Res. 44(2):632–650
2019
Later among the works it cites.
Xu Y (2019) Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. ISSN 1436-4646, URL http://dx.doi.org/10.1007/s10107-019-01425-9
2019
Later among the works it cites.
2021
Closest in time.
Kong W, Melo JG, Monteiro RDC (2021) FISTA and Extensions - Review and New Insights. Optimization Online
2021
Closest in time.
Kong W, Monteiro RDC (2021) An accelerated inexact proximal point method for solving nonconvex-concave min-max problems. SIAM Journal on Optimization 31(4):2558–2585
2021
Closest in time.