Fetching the paper…
Reading the bibliography…
We propose a practical inexact augmented Lagrangian method (iALM) for nonconvex problems with nonlinear constraints.
Multiplier and gradient methods
M. R. Hestenes · 1969
Earlier work this paper cites.
A method for nonlinear constraints in minimization problems
M. J. Powell · 1969
Earlier work this paper cites.
Convex analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
On penalty and multiplier methods for constrained minimization
D. P. Bertsekas · 1976
Earlier work this paper cites.
Constrained optimization and lagrange multiplier methods
D. P. Bertsekas · 1982
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate o (1/kˆ 2)
Y. E. Nesterov · 1983
Earlier work this paper cites.
Lagrange multipliers and optimality
R. T. Rockafellar · 1993
Earlier work this paper cites.
Problems of distance geometry and convex properties of quadratic maps
A. I. Barvinok · 1995
Earlier work this paper cites.
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
G. Pataki · 1998
Earlier work this paper cites.
Semidefinite programming relaxations for the quadratic assignment problem
Q. Zhao, S. E. Karisch, F. Rendl, and H. Wolkowicz · 1998
Earlier work this paper cites.
Convergence properties of the bfgs algoritm
Y.-H. Dai · 2002
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S. Burer and R. D. Monteiro · 2003
Earlier work this paper cites.
Semidefinite programs and combinatorial optimization
L. Lovász · 2003
Earlier work this paper cites.
The bfgs method with exact line searches fails for non-convex objective functions
W. F. Mascarenhas · 2004
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
S. Burer and R. D. Monteiro · 2005
Earlier work this paper cites.
Numerical Optimization
J. Nocedal and S. Wright · 2006
Earlier work this paper cites.
Fast low-rank semidefinite programming for embedding and clustering
B. Kulis, A. C. Surendran, and J. C. Platt · 2007
Earlier work this paper cites.
Approximating K–means–type clustering via semidefinite programming
J. Peng and Y. Wei · 2007
Earlier work this paper cites.
A dependence maximization view of clustering
L. Song, A. Smola, A. Gretton, and K. M. Borgwardt · 2007
Earlier work this paper cites.
Optimal algorithms and inapproximability results for every csp?
P. Raghavendra · 2008
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Earlier work this paper cites.
On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
C. Cartis, N. I. Gould, and P. L. Toint · 2011
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Earlier work this paper cites.
Grothendieck-type inequalities in combinatorial optimization
S. Khot and A. Naor · 2011
Earlier work this paper cites.
Group lasso with overlaps: the latent group lasso approach
G. Obozinski, L. Jacob, and J.-P. Vert · 2011
Cited alongside, same era.
Angular synchronization by eigenvectors and semidefinite programming
A. Singer · 2011
Cited alongside, same era.
Three-dimensional structure determination from common lines in cryo-em by eigenvectors and semidefinite programming
A. Singer and Y. Shkolnisky · 2011
Cited alongside, same era.
Complexity bounds for second-order optimality in unconstrained optimization
C. Cartis, N. I. Gould, and P. L. Toint · 2012
Cited alongside, same era.
Local convergence of exact and inexact augmented lagrangian methods under the second-order sufficient optimality condition
D. Fernandez and M. V. Solodov · 2012
Cited alongside, same era.
Efficient algorithms for large-scale generalized eigenvector computation and canonical correlation analysis
R. Ge, C. Jin, P. Netrapalli, A. Sidford, et al · 2016
Later among the works it cites.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
S. Ghadimi and G. Lan · 2016
Later among the works it cites.
Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition
H. Karimi, J. Nutini, and M. Schmidt · 2016
Later among the works it cites.
Iteration-complexity of first-order augmented lagrangian methods for convex programming
G. Lan and R. D. Monteiro · 2016
Later among the works it cites.
Clustering subgaussian mixtures by semidefinite programming
D. G. Mixon, S. Villar, and R. Ward · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A complete characterization of strong duality in nonconvex optimization with a single constraint
F. Flores-Bazán, F. Flores-Bazán, and C. Vera · 2012
Cited alongside, same era.
Practical methods of optimization
R. Fletcher · 2013
Cited alongside, same era.
Revisiting frank-wolfe: Projection-free sparse convex optimization
M. Jaggi · 2013
Cited alongside, same era.
Constrained optimization and Lagrange multiplier methods
D. P. Bertsekas · 2014
Cited alongside, same era.
Practical augmented Lagrangian methods for constrained optimization
E. G. Birgin and J. M. Mart_nez · 2014
Cited alongside, same era.
Manopt, a matlab toolbox for optimization on manifolds
N. Boumal, B. Mishra, P.-A. Absil, and R. Sepulchre · 2014
Cited alongside, same era.
Generative Adversarial Networks
I. J. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio · 2014
Cited alongside, same era.
D. Park, A. Kyrillidis, S. Bhojanapalli, C. Caramanis, and S. Sanghavi · 2016
Later among the works it cites.
From error bounds to the complexity of first-order descent methods for convex functions
J. Bolte, T. P. Nguyen, J. Peypouquet, and B. W. Suter · 2017
Later among the works it cites.
The Robust Manifold Defense: Adversarial Training using Generative Models
A. Ilyas, A. Jalal, E. Asteri, C. Daskalakis, and A. G. Dimakis · 2017
Later among the works it cites.
Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms, 2017
H. Xiao, K. Rasul, and R. Vollgraf · 2017
Later among the works it cites.
Iteration complexity of inexact augmented lagrangian methods for constrained convex programming
Y. Xu · 2017
Later among the works it cites.
A globally convergent algorithm for nonconvex optimization based on block coordinate update
Y. Xu and W. Yin · 2017
Later among the works it cites.
Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form
S. Bhojanapalli, N. Boumal, P. Jain, and P. Netrapalli · 2018
Later among the works it cites.
Nonconvex lagrangian-based optimization: monitoring schemes and global convergence
J. Bolte, S. Sabach, and M. Teboulle · 2018
Later among the works it cites.
Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
C. Cartis, N. I. Gould, and P. L. Toint · 2018
Later among the works it cites.
Acceleration and global convergence of a first-order primal–dual method for nonconvex problems
C. Clason, S. Mazurenko, and T. Valkonen · 2018
Later among the works it cites.
Semidefinite programming approach for the quadratic assignment problem with a sparse graph
J. F. B. Ferreira, Y. Khoo, and A. Singer · 2018
Later among the works it cites.
Convergence to second-order stationarity for constrained non-convex optimization
M. Nouiehed, J. D. Lee, and M. Razaviyayn · 2018
Later among the works it cites.
Defense-GAN: Protecting classifiers against adversarial attacks using generative models
P. Samangouei, M. Kabkab, and R. Chellappa · 2018
Later among the works it cites.
Clustering is semidefinitely not that hard: Nonnegative sdp for manifold disentangling
M. Tepper, A. M. Sengupta, and D. Chklovskii · 2018
Later among the works it cites.
An adaptive primal-dual framework for nonsmooth convex minimization
Q. Tran-Dinh, A. Alacaoglu, O. Fercoq, and V. Cevher · 2018
Later among the works it cites.
A smooth primal-dual optimization framework for nonsmooth composite convex minimization
Q. Tran-Dinh, O. Fercoq, and V. Cevher · 2018
Later among the works it cites.
Rank optimality for the burer-monteiro factorization
I. Waldspurger and A. Waters · 2018
Later among the works it cites.
A. Yurtsever, O. Fercoq, F. Locatello, and V. Cevher · 2018
Later among the works it cites.