An efficient approach to solve the large-scale semidefinite programming problems
Summary: Solving the large-scale problems with semidefinite programming (SDP) constraints is of great importance in modeling and model reduction of complex system, dynamical system, optimal control, computer vision, and machine learning. However, existing SDP solvers are of large complexities and thus unavailable to deal with large-scale problems. In this paper, we solve SDP using matrix generation, which is an extension of the classical column generation. The exponentiated gradient algorithm is also used to solve the special structure subproblem of matrix generation. The numerical experiments show that our approach is efficient and scales very well with the problem dimension. Furthermore, the proposed algorithm is applied for a clustering problem. The experimental results on real datasets imply that the proposed approach outperforms the traditional interior-point SDP solvers in terms of efficiency and scalability.
- 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
- 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
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- 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
- An optimal approach for the critical node problem using semidefinite programming
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches
- Application of lower-bound direct method to large-scale problems
- Optimal link removal for epidemic mitigation: A two-way partitioning approach
- Scalable semidefinite programming
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting
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)
