An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
From MaRDI portal
Publication:4899024
DOI10.1137/110847081zbMath1401.90120OpenAlexW2070740567MaRDI QIDQ4899024
Defeng Sun, Kim-Chuan Toh, Kaifeng Jiang
Publication date: 4 January 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110847081
structured convex optimizationconvex quadratic SDPinexact accelerated proximal gradientsemismooth Newton-CG
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Iterative numerical methods for linear systems (65F10)
Related Items
Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method, On how to solve large-scale log-determinant optimization problems, A method for weighted projections to the positive definite cone, A rank-corrected procedure for matrix completion with fixed basis coefficients, An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, Practical inexact proximal quasi-Newton method with global complexity analysis, An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem, A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives, Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem, A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications, Inexact accelerated augmented Lagrangian methods, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, ``FISTA in Banach spaces with adaptive discretisations, Inexact successive quadratic approximation for regularized optimization, Convergence rates of accelerated proximal gradient algorithms under independent noise, A FE-ADMM algorithm for Lavrentiev-regularized state-constrained elliptic control problem, An acceleration of proximal diagonal Newton method, Inexact proximal stochastic gradient method for convex composite optimization, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, The augmented Lagrangian method based on the APG strategy for an inverse damped gyroscopic eigenvalue problem, Inexact version of Bregman proximal gradient algorithm, An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost, On FISTA with a relative error rule, Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market, A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem, Unnamed Item, Computing the nearest Euclidean distance matrix with low embedding dimensions, Conditional quadratic semidefinite programming: examples and methods, QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming, Convergent prediction-correction-based ADMM for multi-block separable convex programming, An efficient duality-based approach for PDE-constrained sparse optimization, Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates, Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems, A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming, An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost, A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions, An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming, A framework of constraint preserving update schemes for optimization on Stiefel manifold, Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone, A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions, Fused Multiple Graphical Lasso, Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization, An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
Uses Software
