Sanghamitra Roy, Weijen Chen and Charlie
Chung-Ping Chen
|
|
Introduction: |
ConvexFit is a tool to generate convex
data from non-convex tables. ConvexFit directly adjusts
the table values into a numerically convex table without an explicit analytical form.
The underlying methodology is based on minimizing the perturbation by formulating a
convex semidefinite optimization problem. ConvexFit uses the DSDP 5.7 software as a
semidefinite programming solver. Currently ConvexFit supports 1/2/3 dimensional data tables.
It generates the numerically convexified data table.
|
|
OS Requirement: |
PC
(Windows based)
|
|
Input/Output File Format: |
The input file can contain up to three parameters. x_index, y_index, and z_index represent the parameters in order. value(i,j,k) represents the table value for parameters x_index(i),y_index(j),z_index(k). Sample input files are provided below:
(input_data_3d.out, input_data_2d.out, input_data_1d.out )
The output file is named "convex_data.out" and contains a similar format as the input file.
|
|
Usage and Examples: |
ConvexFit [input file name]
The numerically convex data will be
automatically saved to convex_data.out.
Example:
ConvexFit input_data_3d.out
This software currently supports a table of maximum size 500x500x500 points.
Please note that the boundary points are not convexified. For example, if you have a 4x4 table, only the inner 3x3 points will be convexified. If you want to convexify the entire 4x4 table, extrapolate the table to 5x5 (using linear/quadratic techniques). Then use the 5x5 table as input to the software.
|
|
Download |
ConvexFit for Windows: ConvexFit.exe
|
|
Reference: [1] Sanghamitra Roy, Weijen Chen, and Charlie Chung-Ping Chen, "ConvexFit: An Optimal Minimum-Error Convex Fitting and Smoothing Algorithm with Application to Gate-Sizing." ICCAD 2005, accepted.
|
|
|
Technical Support: |
All questions and suggestions are welcome here.