Mixed-integer Programming Representations of Linear Model Decision Tree Surrogates
Explore the source record for details and available documents.
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Three algorithms are developed that may be based exclusively on hyperspherically deduced cuts. The algorithms only apply, therefore, to problems structured so that these cuts are valid. The algorithms are shown to be finite.
Winograd (1976) has developed a new class of algorithms which depend heavily on the computation of a cyclic convolution for computing the conventional DFT (discrete Fourier transform); this new algorithm, for a few hundred transform points, requires substantially fewer multiplications than the conventional FFT algorithm. Reed and Truong have defined a special class of finite Fourier-like transforms over GF(q squared), where q = 2 to the p power minus 1 is a Mersenne prime for p = 2, 3, 5, 7, 13, 17, 19, 31, 61. In the present paper it is shown that Winograd's algorithm can be combined with the aforementioned Fourier-like transform to yield a new algorithm for computing the DFT. A fast method for accurately computing the DFT of a sequence of complex numbers of very long transform-lengths is thus obtained.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
A method for determining the most effective locations for active struts on large space structures is developed and tested on the NASA CSI Evolutionary Model. Depending on the choice of weighting factors, the method can be used to maximize the maximum modal damping ratio or decay rate, or to maximize a mission-oriented measure of performance. Placement of 8, 16, and 32 active struts out of 1507 candidate truss elements is demonstrated. Preliminary estimates of damping enhancement are reported pending refined structural models and dynamic test results. The method can handle complicated FEM models wih a large number of truss elements and many target modes. It can treat each mode equally or it can emphasize the importance of selected modes. The method can eliminate some combinations of actuator locations based on topological constraints.
Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in solving combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on a large space structure and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
In this paper, we propose to solve the constrained optimization problem in two phases. The first phase uses heuristic methods such as the ant colony method, particle swarming optimization, and genetic algorithm to seek a near optimal solution among a list of feasible initial populations. The final optimal solution can be found by using the solution of the first phase as the initial condition to the SQP algorithm. We demonstrate the above problem formulation and optimization schemes with a large-scale network that includes the DSN ground stations and a number of spacecraft of deep space missions.
No abstract provided
No abstract prepared.
Abstract Not Provided
Abstract Not Provided