SDPTools: High Precision SDP Solver in Maple
نویسنده
چکیده
Semidefinite programs are an important class of convex optimization problems. It can be solved efficiently by SDP solvers in Matlab, such as SeDuMi, SDPT3, DSDP. However, since we are running fixed precision SDP solvers in Matlab, for some applications, due to the numerical error, we can not get good results. SDPTools is a Maple package to solve SDP in high precision. We apply SDPTools to the certification of the global optimum of rational functions. For the Rumps Model Problem, we obtain the best numerical results so far. 1. Preliminaries SDPTools is a Maple package to solve a semidefinite program (SDP): minimize cx s.t. F (x ) ≥ 0 , (1) where F (x ) △ = F0 + m ∑
منابع مشابه
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
We observe that in a simple one-dimensional polynomial optimization problem (POP), the ‘optimal’ values of semidefinite programming (SDP) relaxation problems reported by the standard SDP solvers converge to the optimal value of the POP, while the true optimal values of SDP relaxation problems are strictly and significantly less than that value. Some pieces of circumstantial evidences for the st...
متن کاملConvex Quantifier Elimination for Semidefinite Programming
Semidefinite Programming (SDP) is a class of convex optimization problems with a linear objective function and linear matrix inequality (LMI) constraints. SDP problems have many applications in engineering and applied mathematics. We propose a reasonably fast algorithm to prove and solve SDP exactly by exploiting the convexity of the SDP feasibility domain. This is achieved by combining a symbo...
متن کاملIntegration of SMT-LIB Support into Maple
The SC project arose out of the recognition that the Symbolic Computation and Satisfiability Checking communities mutually benefit from the sharing of results and techniques. An SMT solver can profit from the inclusion of computer algebra techniques in its theory solver, while a computer algebra system can profit from dispatching SAT or SMT queries which arise as sub-problems during computation...
متن کاملHigh Precision Computation of Elementary Functions in Maple
Some methods being used to speed up floating-point computation in Maple are described. Specifically, we discuss the evaluation of the elementary functions square root and logarithm. We also describe the correct rounding of these evaluations. The key efficiency improvement is called progressive precision increase. 1 High Precision Computations in Maple One of the advantages of computer-algebra s...
متن کاملOn Exact Polya and Putinar's Representations
We consider the problem of finding exact sums of squares (SOS) decompositions for certain classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. We start by providing a hybrid numeric-symbolic algorithm computing exact rational SOS decompositions for polynomials lying in the interior of the SOS cone. It computes an approximate SOS decomposition for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1112.6382 شماره
صفحات -
تاریخ انتشار 2011