Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method
From MaRDI portal
Publication:2784430
DOI10.1137/S1052623400376378zbMath1008.90043OpenAlexW2024457515MaRDI QIDQ2784430
Kim-Chuan Toh, Kojima, Masakazu
Publication date: 23 April 2002
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623400376378
interior-point methodsinexact search directionslarge scale semidefinite programmingpreconditioned conjugate residual methoddeflated conjugate gradient method
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51) Methods of reduced gradient type (90C52)
Related Items
An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, GMRES-Accelerated ADMM for Quadratic Objectives, A trust region method for solving semidefinite programs, A matrix generation approach for eigenvalue optimization, Semidefinite programming relaxations for graph coloring and maximal clique problems, On the solution of large-scale SDP problems by the modified barrier method using iterative solvers, Solving large-scale semidefinite programs in parallel, Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs, A globally convergent filter-type trust region method for semidefinite programming, A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion, A semidefinite programming-based heuristic for graph coloring, Local minima and convergence in low-rank semidefinite programming, A survey on conic relaxations of optimal power flow problem, PREDICTOR–CORRECTOR SMOOTHING NEWTON METHOD FOR SOLVING SEMIDEFINITE PROGRAMMING, Computational enhancements in low-rank semidefinite programming, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, An inexact dual logarithmic barrier method for solving sparse semidefinite programs, A novel approach for solving semidefinite programs
Uses Software
