Fetching the paper…
Reading the bibliography…
In this paper, an inexact proximal-point penalty method is studied for constrained optimization problems, where the objective function is non-convex, and the constraint functions can also be non-convex.
Princeton mathematical series. Princeton University Press (1970)
Rockafellar, R.: Convex Analysis · 1970
Earlier work this paper cites.
In: Mathematical Programming The State of the Art, pp. 87–114. Springer (1983)
Fletcher, R.: Penalty functions · 1983
Earlier work this paper cites.
SIAM Journal on Control and Optimization 23
Di Pillo, G., Grippo, L.: A continuously differentiable exact penalty function for nonlinear programming problems with inequality constraints · 1985
Earlier work this paper cites.
Mathematical Programming 36
Di Pillo, G., Grippo, L.: An exact penalty function method with global convergence properties for nonlinear programming problems · 1986
Earlier work this paper cites.
Mathematical Programming 35
Powell, M.J., Yuan, Y.: A recursive quadratic programming algorithm that uses differentiable exact penalty functions · 1986
Earlier work this paper cites.
SIAM Journal on Numerical Analysis 26
Gould, N.I.M.: On the convergence of a sequential penalty function method for constrained minimization · 1989
Earlier work this paper cites.
SIAM Journal on control and optimization 29
Burke, J.V.: An exact penalization viewpoint of constrained optimization · 1991
Earlier work this paper cites.
Tech. rep., Citeseer (1998)
Weston, J., Watkins, C.: Multi-class support vector machines · 1998
Earlier work this paper cites.
Machine learning 47
Crammer, K., Singer, Y.: On the learnability and design of output codes for multiclass problems · 2002
Earlier work this paper cites.
Kluwer Academic Publ. (2004)
Nesterov, Y.: Introductory Lectures on Convex Optimization : a Basic Course · 2004
Earlier work this paper cites.
SIAM Journal on Optimization 16
Byrd, R.H., Gould, N.I., Nocedal, J., Waltz, R.A.: On the convergence of successive linear-quadratic programming algorithms · 2005
Earlier work this paper cites.
SIAM Journal on Optimization 15
Friedlander, M.P., Saunders, M.A.: A globally convergent linearly constrained lagrangian method for nonlinear optimization · 2005
Earlier work this paper cites.
Mathematical Programming 125
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.
SIAM Journal on Optimization 21
Cartis, C., Gould, N.I., Toint, P.L.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming · 2011
Earlier work this paper cites.
Mathematical programming 127
Nesterov, Y.: Barrier subgradient method · 2011
Earlier work this paper cites.
SIAM Journal on Optimization 22
Fernández, D., Solodov, M.V.: Local convergence of exact and inexact augmented lagrangian methods under the second-order sufficient optimality condition · 2012
Earlier work this paper cites.
SIAM Journal on Optimization 23
Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming · 2013
Earlier work this paper cites.
Mathematical Programming 138
Lan, G., Monteiro, R.D.: Iteration-complexity of first-order penalty methods for convex programming · 2013
Earlier work this paper cites.
Mathematical Programming 140
Nesterov, Y.: Gradient methods for minimizing composite functions · 2013
Earlier work this paper cites.
arXiv preprint arXiv 1308
Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: Composite self-concordant minimization · 2013
Earlier work this paper cites.
Mathematical Programming 144
Cartis, C., Gould, N.I., Toint, P.L.: On the complexity of finding first-order critical points in constrained nonlinear optimization · 2014
Earlier work this paper cites.
arXiv preprint arXiv:1406.5403 (2014)
Tran-Dinh, Q., Cevher, V.: A primal-dual algorithmic framework for constrained convex minimization · 2014
Earlier work this paper cites.
SIAM Journal on Optimization 24
Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: An inexact proximal path-following algorithm for constrained convex minimization · 2014
Earlier work this paper cites.
arXiv preprint arXiv:1410.8625 (2014)
Wang, F., Xu, Z., Xu, H.K.: Convergence of bregman alternating direction method with multipliers for nonconvex composite problems · 2014
Earlier work this paper cites.
Computational Optimization & Applications 60
Lin, Q., Xiao, L.: An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization · 2015
Earlier work this paper cites.
Optimization Methods and Software 31
Curtis, F.E., Gould, N.I., Jiang, H., Robinson, D.P.: Adaptive augmented lagrangian methods: algorithms and practical numerical experience · 2016
Earlier work this paper cites.
Math. Program. 156
Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming · 2016
Earlier work this paper cites.
arXiv preprint arXiv:1604.00543 (2016)
Hong, M.: Decomposing linearly constrained nonconvex problems by a proximal primal dual approach: Algorithms, convergence, and applications · 2016
Cited alongside, same era.
arXiv preprint arXiv:1604.03887 (2016)
Lan, G., Zhou, Z.: Algorithms for stochastic optimization with expectation constraints · 2016
Cited alongside, same era.
In: Proceedings of the 33rd International Conference on International Conference on Machine Learning (ICML), pp. 314–323. JMLR.org (2016)
Reddi, S.J., Hefny, A., Sra, S., Póczós, B., Smola, A.: Stochastic variance reduction for nonconvex optimization · 2016
Cited alongside, same era.
In: Proceedings of the 34th International Conference on Machine Learning (ICML), pp. 89–97 (2017)
Allen-Zhu, Z.: Natasha: Faster non-convex stochastic optimization via strongly non-convex parameter · 2017
Cited alongside, same era.
Mathematical Programming 161
arXiv preprint arXiv:1906.03401 (2019)
Basu, K., Nandy, P.: Optimal convergence for stochastic optimization with multiple expectation constraints · 2019
Closest in time.
arXiv preprint arXiv:1907.02401 (2019)
Birgin, E., Martínez, J.: Complexity and performance of an augmented lagrangian algorithm · 2019
Closest in time.
arXiv preprint arXiv:1908.02734 (2019)
Boob, D., Deng, Q., Lan, G.: Proximal point methods for optimization with nonconvex functional constraints · 2019
Closest in time.
arXiv preprint 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 178
Haeser, G., Liu, H., Ye, Y.: Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cartis, C., Gould, N.I., Toint, P.L.: Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization · 2017
Cited alongside, same era.
arXiv preprint arXiv:1707.03505 (2017)
Davis, D., Grimmer, B.: Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems · 2017
Cited alongside, same era.
arXiv preprint arXiv:1702.01850 (2017)
Gonçalves, M.L., Melo, J.G., Monteiro, R.D.: Convergence rate bounds for a proximal admm with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems · 2017
Cited alongside, same era.
arXiv preprint arXiv:1705.07229 (2017)
Melo, J.G., Monteiro, R.D.: Iteration-complexity of a Jacobi-type non-euclidean ADMM for multi-block linearly constrained nonconvex programs · 2017
Cited alongside, same era.
Mathematics of Computation 86
Wang, X., Ma, S., Yuan, Y.x.: Penalty methods with stochastic approximation for stochastic nonlinear programming · 2017
Cited alongside, same era.
arXiv preprint arXiv:1711.08020 (2017)
Xu, Y.: First-order methods for constrained convex programming based on linearized augmented lagrangian function · 2017
Cited alongside, same era.
In: Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 3901–3910. JMLR. org (2017)
Yang, T., Lin, Q., Zhang, L.: A richer theory of convex constrained optimization with reduced projections and improved rates · 2017
Cited alongside, same era.
In: Advances in Neural Information Processing Systems, pp. 1428–1438 (2017)
Yu, H., Neely, M., Wei, X.: Online convex optimization with stochastic constraints · 2017
Cited alongside, same era.
Closest in time.
Mathematical Programming 176
Hajinezhad, D., Hong, M.: Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization · 2019
Closest in time.
Computational Optimization and Applications 72
Jiang, B., Lin, T., Ma, S., Zhang, S.: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis · 2019
Closest in time.
arXiv preprint arXiv:1907.12424 (2019)
Jiang, B., Meng, X., Wen, Z., Chen, X.: An exact penalty approach for optimization with nonnegative orthogonality constraints · 2019
Closest in time.
SIAM Journal on Optimization 29
Kong, W., Melo, J.G., Monteiro, R.D.: Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs · 2019
Closest in time.
arXiv preprint arXiv:1908.11518v1 (2019)
Lin, Q., Ma, R., Xu, Y.: Inexact proximal-point penalty methods for non-convex optimization with non-convex constraints · 2019
Closest in time.
arXiv preprint arXiv:1907.04450 (2019)
Lu, S., Razaviyayn, M., Yang, B., Huang, K., Hong, M.: Snap: Finding approximate second-order stationary solutions efficiently for non-convex linearly constrained problems · 2019
Closest in time.
arXiv preprint arXiv:1908.01871 (2019)
Ma, R., Lin, Q., Yang, T.: Proximally constrained methods for weakly convex optimization with weakly convex constraints · 2019
Closest in time.
Optimization Methods and Software 34
Necoara, I., Patrascu, A., Glineur, F.: Complexity of first-order inexact lagrangian and penalty methods for conic convex programming · 2019
Closest in time.
arXiv preprint arXiv:1904.03563 (2019)
O’Neill, M., Wright, S.J.: A log-barrier newton-cg method for bound constrained optimization with complexity guarantees · 2019
Closest in time.
In: Advances in Neural Information Processing Systems (2019)
Sahin, M.F., eftekhari, A., Alacaoglu, A., Latorre, F., Cevher, V.: An inexact augmented lagrangian framework for nonconvex optimization with nonlinear constraints · 2019
Closest in time.
Computational Optimization and Applications 72
Tran-Dinh, Q.: Proximal alternating penalty algorithms for nonsmooth constrained convex optimization · 2019
Closest in time.
arXiv preprint arXiv:1906.00570 (2019)
Wang, S., Chang, T.H., Cui, Y., Pang, J.S.: Clustering by orthogonal nmf model and non-convex penalty optimization · 2019
Closest in time.
Journal of Scientific Computing 78
Wang, Y., Yin, W., Zeng, J.: Global convergence of admm in nonconvex nonsmooth optimization · 2019
Closest in time.
arXiv preprint arXiv:1908.00131 (2019)
Xie, Y., Wright, S.J.: Complexity of proximal augmented lagrangian for nonconvex optimization with nonlinear equality constraints · 2019
Closest in time.
Mathematical Programming, Series A (online first) pp. 1–46 (2019)
Xu, Y.: Iteration complexity of inexact augmented lagrangian methods for constrained convex programming · 2019
Closest in time.
arXiv preprint arXiv:2008.07080 (2020)
Kong, W., Melo, J.G., Monteiro, R.D.: Iteration-complexity of a proximal augmented lagrangian method for solving nonconvex composite optimization problems with nonlinear convex constraints · 2020
Closest in time.
arXiv preprint arXiv:2007.01284 (2020)
Li, Z., Chen, P.Y., Liu, S., Lu, S., Xu, Y.: Rate-improved inexact augmented lagrangian method for constrained nonconvex optimization · 2020
Closest in time.
arXiv preprint arXiv:2003.08880 (2020)
Li, Z., Xu, Y.: Augmented lagrangian based first-order methods for convex and nonconvex programs: nonergodic convergence and iteration complexity · 2020
Closest in time.
arXiv preprint arXiv:2008.00562 (2020)
Melo, J.G., Monteiro, R.D.: Iteration-complexity of an inner accelerated inexact proximal augmented lagrangian method based on the classical lagrangian function and a full lagrange multiplier update · 2020
Closest in time.
arXiv preprint arXiv:2006.08048 (2020)
Melo, J.G., Monteiro, R.D., Wang, H.: Iteration-complexity of an inexact proximal accelerated augmented lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems · 2020
Closest in time.
arXiv preprint arXiv:2006.16440 (2020)
Zhang, J., Luo, Z.: A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization · 2020
Closest in time.
SIAM Journal on Optimization 30
Zhang, J., Luo, Z.Q.: A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization · 2020
Closest in time.