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

DOI10.1155/2012/764760zbMath1264.90137OpenAlexW1978919927WikidataQ58911810 ScholiaQ58911810MaRDI QIDQ1955162

Sheng Liu, Xinsheng Huang, Yongbin Zheng, Yuzhuang Yan, 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) Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06)

Related Items

An optimal approach for the critical node problem using semidefinite programming ⋮ Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches ⋮ Optimal link removal for epidemic mitigation: A two-way partitioning approach

Uses Software

• SDPT3
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• Exact solution of impulse response to a class of fractional oscillators and its stability
• Exponentiated gradient versus gradient descent for linear predictors
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Graph Implementations for Nonsmooth Convex Programs
• A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints
• Selected Topics in Column Generation
• Semidefinite Hankel-Type Model Reduction Based on Frequency Response Matching
• Approximating K‐means‐type Clustering via Semidefinite Programming

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