An efficient approach to solve the large-scale semidefinite programming problems

DOI10.1155/2012/764760MaRDI QIDQ1955162zbMATH OpenOpenAlexWikidataFDO

Authors Yongbin Zheng, Yuzhuang Yan, Sheng Liu, Xinsheng Huang, Wanying Xu

Publication date 11 June 2013

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2012/764760

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Semidefinite programming (90C22)

Recommendations

• Scalable semidefinite programming
• Large-scale semidefinite programming via a saddle point mirror-prox algorithm
• Exploiting structured sparsity in large scale semidefinite programming problems
• Solving a class of semidefinite programs via nonlinear programming
• Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints
• Approximating K‐means‐type Clustering via Semidefinite Programming
• Exact solution of impulse response to a class of fractional oscillators and its stability
• Exponentiated gradient versus gradient descent for linear predictors
• Graph implementations for nonsmooth convex programs
• Learning the kernel matrix with semidefinite programming
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Selected Topics in Column Generation
• Semidefinite Hankel-Type Model Reduction Based on Frequency Response Matching
• Solving semidefinite-quadratic-linear programs using SDPT3

Cited in

(7)

• Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches
• Latest Developments in the SDPA Family for Solving Large-Scale SDPs
• Optimal link removal for epidemic mitigation: A two-way partitioning approach
• An optimal approach for the critical node problem using semidefinite programming
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting
• Application of lower-bound direct method to large-scale problems
• Scalable semidefinite programming

Describes a project that uses

Uses Software

• CVX
• SDPT3

This page was built for publication: An efficient approach to solve the large-scale semidefinite programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955162)