Fetching the paper…
Reading the bibliography…
We analyze worst-case complexity of a Proximal augmented Lagrangian (Proximal AL) framework for nonconvex optimization with nonlinear equality constraints.
Journal of Optimization Theory and Applications
Hestenes, M.R.: Multiplier and gradient methods · 1969
Earlier work this paper cites.
In: Optimization (Sympos., Univ. Keele, Keele, 1968), pp. 283–298. Academic Press, London (1969)
Powell, M.J.D.: A method for nonlinear constraints in minimization problems · 1969
Earlier work this paper cites.
Mathematics of Operations Research
Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming · 1976
Earlier work this paper cites.
SIAM Journal on Optimization
Andreani, R., Birgin, E.G., Martínez, J.M., Schuverdt, M.L.: On augmented Lagrangian methods with general lower-level constraints · 2008
Earlier work this paper cites.
Computational Optimization and Applications
Andreani, R., Birgin, E.G., Martínez, J.M., Schuverdt, M.L.: Second-order negative-curvature methods for box-constrained and general constrained optimization · 2010
Earlier work this paper cites.
Mathematical Programming
Birgin, E.G., Floudas, C.A., Martínez, J.M.: Global minimization using an augmented Lagrangian method with variable lower-level constraints · 2010
Earlier work this paper cites.
Foundations and Trends® in Machine Learning
Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers · 2011
Earlier work this paper cites.
SIAM Journal on Optimization
Cartis, C., Gould, N., Toint, P.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming · 2011
Earlier work this paper cites.
Journal of Complexity
Cartis, C., Gould, N., Toint, P.: Complexity bounds for second-order optimality in unconstrained optimization · 2012
Earlier work this paper cites.
SIAM Journal on Optimization
Cartis, C., Gould, N.I.M., Toint, P.L.: On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization · 2013
Earlier work this paper cites.
Academic press (2014)
Bertsekas, D.P.: Constrained optimization and Lagrange multiplier methods · 2014
Earlier work this paper cites.
Mathematical Programming, Series A
Cartis, C., Gould, N.I.M., Toint, P.L.: On the complexity of finding first-order critical points in constrained nonlinear optimization · 2014
Earlier work this paper cites.
Mathematical Programming
Bian, W., Chen, X., Ye, Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization · 2015
Cited alongside, same era.
Mathematical Programming
Curtis, F.E., Jiang, H., Robinson, D.P.: An adaptive augmented Lagrangian method for large-scale constrained optimization · 2015
Cited alongside, same era.
In: 2015 International Conference on Sampling Theory and Applications (SampTA), pp. 407–410 (2015)
Sun, J., Qu, Q., Wright, J.: Complete dictionary recovery over the sphere · 2015
Cited alongside, same era.
SIAM Journal on Optimization
Andreani, R., Martínez, J.M., Ramos, A., Silva, P.J.S.: A cone-continuity constraint qualification and algorithmic consequences · 2016
Cited alongside, same era.
Mathematical Programming
Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming · 2016
Cited alongside, same era.
IMA Journal of Numerical Analysis
Andreani, R., Haeser, G., Ramos, A., Silva, P.J.S.: A second-order sequential optimality condition associated to the convergence of optimization algorithms · 2017
arXiv e-prints arXiv:1810.02024 (2018)
Nouiehed, M., Lee, J.D., Razaviyayn, M.: Convergence to second-order stationarity for constrained non-convex optimization · 2018
Later among the works it cites.
SIAM Journal on Optimization
Andreani, R., Fazzio, N., Schuverdt, M., Secchin, L.: A sequential optimality condition related to the quasi-normality constraint qualification and its algorithmic consequences · 2019
Closest in time.
Journal of Complexity
Cartis, C., Gould, N.I.M., Toint, P.L.: Optimization of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization · 2019
Closest in time.
arXiv e-prints arXiv: 1906.05622 (2019)
Grapiglia, G.N., Yuan, Y.X.: On the complexity of an augmented Lagrangian method for nonconvex optimization · 2019
Closest in time.
Mathematical Programming (2019)
Hajinezhad, D., Hong, M.: Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Mathematical Programming
Birgin, E.G., Gardenghi, J., Martínez, J.M., Santos, S.A., Toint, P.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models · 2017
Cited alongside, same era.
SIAM Journal on Optimization
Grapiglia, G.N., Nesterov, Y.: Regularized Newton methods for minimizing functions with Hölder continuous Hessians · 2017
Cited alongside, same era.
In: D. Precup, Y.W. Teh (eds.) Proceedings of the 34th International Conference on Machine Learning,
Hong, M., Hajinezhad, D., Zhao, M.M.: Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks · 2017
Cited alongside, same era.
SIAM Journal on Optimization
Andreani, R., Secchin, L., Silva, P.: Convergence properties of a second order augmented Lagrangian method for mathematical programs with complementarity constraints · 2018
Cited alongside, same era.
Computational Optimization and Applications
Birgin, E.G., Haeser, G., Ramos, A.: Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points · 2018
Cited alongside, same era.
Mathematical Programming (2018)
Haeser, G., Liu, H., Ye, Y.: Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary · 2018
Cited alongside, same era.
Jiang, B., Lin, T., Ma, S., Zhang, S.: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis · 2019
Closest in time.
In: Proceedings of the 2019 SIAM International Conference on Data Mining, pp. 387–395 (2019)
Liu, K., Li, Q., Wang, H., Tang, G.: Spherical principal component analysis · 2019
Closest in time.
Mathematical Programming (2019)
Royer, C.W., O’Neill, M., Wright, S.J.: A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization · 2019
Closest in time.
Optimization Methods and Software
Birgin, E.G., Martínez, J.M.: Complexity and performance of an Augmented Lagrangian algorithm · 2020
Closest in time.
IMA Journal of Numerical Analysis (2020)
O’Neill, M., Wright, S.J.: A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees · 2020
Closest in time.
SIAM Journal on Optimization
Zhang, J., Luo, Z.Q.: A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization · 2020
Closest in time.