Semidefinite programming solution of economic dispatch problem with non-smooth, non-convex cost functions
42
Citation
50
Reference
10
Related Paper
Citation Trend
Keywords:
Semidefinite Programming
Economic Dispatch
Rank (graph theory)
Semidefinite embedding
Semidefinite Programming
Semidefinite embedding
Second-order cone programming
Cite
Citations (5)
Semidefinite Programming
Semidefinite embedding
Rounding
Second-order cone programming
Linear programming relaxation
Randomized rounding
Cite
Citations (4)
Semidefinite Programming
Semidefinite embedding
Second-order cone programming
Cite
Citations (3)
The Boundary point method,which have been introduced in paper for solving linear semidefinite programming,will be used to find the solution of a special convex quadratic semidefinite programming in this paper.Moreover,the global convergent analysis is given too.
Semidefinite Programming
Semidefinite embedding
Second-order cone programming
Interior point method
Conic optimization
Cite
Citations (0)
In semidefinite programming, one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex optimization problems. semidefinite programming unifies several standard problems (e.g., linear and quadratic programming) and finds many applications in engineering and combinatorial optimization. Although semidefinite programs are much more general than linear programs, they are not much harder to solve. Most interior-point methods for linear programming have been generalized to semidefinite programs. As in linear programming, these methods have polynomial worst-case complexity and perform very well in practice. This paper gives a survey of the theory and applications of semidefinite programs and an introduction to primaldual interior-point methods for their solution.
Semidefinite Programming
Semidefinite embedding
Second-order cone programming
Interior point method
Conic optimization
Linear matrix inequality
Cite
Citations (3,970)
Semidefinite Programming
Semidefinite embedding
Second-order cone programming
Sequential quadratic programming
Cite
Citations (0)
Based on the quadratic integral programming model of the multiuser detection problem,a detection strategy by the semidefinite programming method with pretreatment is presented.A pretreatment method is used to obtain an equivalent quadratic integral model with a lesser scale.Then,we give the semidefinite programming relaxation for the equivalent quadratic integral model.Coupled with the randomized method,we obtain the suboptimal solution to the multiuser detection problem.Compared with the semidefinite programming method,our method has the advantages of lower bit error rate and lesser CPU time,which simulations have proved.
Semidefinite Programming
Semidefinite embedding
Second-order cone programming
Sequential quadratic programming
Cite
Citations (0)
A perturbed problem for semidefinite programming problem was constructed.Compared with the standard problem for semidefinite programming,the perturbed problem has a strictly feasible solution.This was mainly applied to designing and analyzing the infeasible interior-point algorithm for semidefinite programming.
Semidefinite Programming
Semidefinite embedding
Interior point method
Second-order cone programming
Cite
Citations (0)
Semidefinite embedding
Semidefinite Programming
Second-order cone programming
Cite
Citations (0)