Description: GloptiPoly 3: moments, optimization and
semidefinite programming.
Gloptipoly 3 is intended to solve, or at least approximate, the Generalized Problem of
Moments (GPM), an infinite-dimensional optimization problem which can be viewed as
an extension of the classical problem of moments [8]. From a theoretical viewpoint, the
GPM has developments and impact in various areas of mathematics such as algebra,
Fourier analysis, functional analysis, operator theory, probability and statistics, to cite
a few. In addition, and despite a rather simple and short formulation, the GPM has a
large number of important applications in various fields such as optimization, probability,
finance, control, signal processing, chemistry, cristallography, tomography, etc. For an
account of various methodologies as well as some of potential applications, the interested
reader is referred to [1, 2] and the nice collection of papers [5]. Platform: |
Size: 200592 |
Author:askool |
Hits:
Description: GloptiPoly 3: moments, optimization and
semidefinite programming.
Gloptipoly 3 is intended to solve, or at least approximate, the Generalized Problem of
Moments (GPM), an infinite-dimensional optimization problem which can be viewed as
an extension of the classical problem of moments [8]. From a theoretical viewpoint, the
GPM has developments and impact in various areas of mathematics such as algebra,
Fourier analysis, functional analysis, operator theory, probability and statistics, to cite
a few. In addition, and despite a rather simple and short formulation, the GPM has a
large number of important applications in various fields such as optimization, probability,
finance, control, signal processing, chemistry, cristallography, tomography, etc. For an
account of various methodologies as well as some of potential applications, the interested
reader is referred to [1, 2] and the nice collection of papers [5].-GloptiPoly 3: moments, optimization andsemidefinite programming.Gloptipoly 3 is intended to solve, or at least approximate, the Generalized Problem ofMoments (GPM), an infinite-dimensional optimization problem which can be viewed asan extension of the classical problem of moments [8] . From a theoretical viewpoint, theGPM has developments and impact in various areas of mathematics such as algebra, Fourier analysis, functional analysis, operator theory, probability and statistics, to citea few. In addition, and despite a rather simple and short formulation, the GPM has alarge number of important applications in various fields such as optimization, probability, finance, control, signal processing, chemistry, cristallography, tomography, etc. For anaccount of various methodologies as well as some of potential applications, the interestedreader is referred to [ 1, 2] and the nice collection of papers [5]. Platform: |
Size: 200704 |
Author:askool |
Hits:
Description: On the implementation and usage of SDPT3
– a Matlab software package for
semidefinite-quadratic-linear programming,
version 4.0 Platform: |
Size: 2586624 |
Author:hnytsyz |
Hits:
Description: 一个求解半正定规划的数值算法包，包括 C 语言实现的源代码和 MATLAB 的调用接口。这是目前项目发布的最新版本 6.1.0。-Copyright 1997-2010, Brian Borchers. This copy of CSDP is made
available under the Common Public License. See LICENSE for the
details of the CPL.
CSDP is a software package for solving semidefinite programming
problems. The algorithm is a predictor-corrector version of the
primal-dual barrier method of Helmberg, Rendl, Vanderbei, and
Wolkowicz.
This file includes binary code for SDP for Windows.
doc documentation.
matlab MATLAB/Octave routines for interfacing to CSDP.
bin The binary code.
Contact/Support:
If you are having trouble running the code, see the doc directory
first. The project s website can be found at
https://projects.coin-or.org/Csdp/
The project s maintainer can be reached by email at borchers@nmt.edu. Please
email bug reports and feature requests.
Platform: |
Size: 1344512 |
Author:bsmyht |
Hits:
Description: Estimate sensor positions based on semidefinite programming relaxation of the non-convex optimization problem (1), followed by steepest descent with backtracking line search on smooth unconstrained problem (2).
Platform: |
Size: 1024 |
Author:uwsn |
Hits:
Description: Our normalization procedure can be used to improve
the performance of many existing graph matching algorithms, including spectral
matching, graduated assignment and semidefinite programming.-Our normalization procedure can be used to improve the performance of many existing graph matching algorithms, including spectral matching, graduated assignment and semidefinite programming. Platform: |
Size: 417792 |
Author:zyx93 |
Hits:
Description: 半定规划内点法数据整理交直流系统统一无功优化算法，系数矩阵的确定。-Interior point method for semidefinite programming data collation AC and DC systems unified reactive power optimization algorithm to determine the coefficient matrix. Platform: |
Size: 2048 |
Author:王凌然 |
Hits:
Search - Semidefinite Programming