Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
From MaRDI portal
Publication:4651963
DOI10.1137/S1052623402419819zbMath1071.90026MaRDI QIDQ4651963
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
interior-point methodspreconditionersaugmented systemsconjugate residual methodsymmetric quasi-minimal residual methodlarge scale semidefinite programmingmaximum-clique problem
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51)
Related Items
A successive constraint approach to solving parameter-dependent linear matrix inequalities, Matrix Relaxations in Combinatorial Optimization, GMRES-Accelerated ADMM for Quadratic Objectives, A boundary point method to solve semidefinite programs, A trust region method for solving semidefinite programs, Large-scale semidefinite programs in electronic structure calculation, On the solution of large-scale SDP problems by the modified barrier method using iterative solvers, Solving large-scale semidefinite programs in parallel, Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems, Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs, Alternating direction augmented Lagrangian methods for semidefinite programming, An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection, Matrix-Free Convex Optimization Modeling, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, A globally convergent filter-type trust region method for semidefinite programming, On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming, SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints, Local minima and convergence in low-rank semidefinite programming, High-accuracy solution of large-scale semidefinite programs, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0, An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming, Using a factored dual in augmented Lagrangian methods for semidefinite programming, Preprocessing sparse semidefinite programs via matrix completion, PREDICTOR–CORRECTOR SMOOTHING NEWTON METHOD FOR SOLVING SEMIDEFINITE PROGRAMMING, Primal-Dual Interior Point Multigrid Method for Topology Optimization, SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0), Computational enhancements in low-rank semidefinite programming, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot's problem, An inexact dual logarithmic barrier method for solving sparse semidefinite programs, A novel approach for solving semidefinite programs, A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
Uses Software
