Journal
Scientific and technical journal «Priborostroenie»
UDK519.853.4
Issue:10 (52)
Download PDF424 Kbyte
PARALLEL METHODS FOR GLOBAL OPTIMIZATION PROBLEM SOLVING
Annotation
Parallel algorithm for solving multiextremal optimization problems with nonconvex constraints is considered. It is based on the reduction of multidimensional problems to the set of joint one-dimensional ones. New scheme of construction of the set of Peano-type space-filling curves is proposed. Suggested scheme preserves a part of information about closeness of points in multidimensional space. The results of numerical experiments showing acceleration of algorithm convergence with use of the new scheme of multiply curves construction are presented.
Keywords
Постоянный URL
Articles in current issue
- INTELLIGENT SOFTWARE PLATFORM FOR COMPLEX SYSTEM COMPUTER SIMULATION: CONCEPTION, ARCHITECTURE AND IMPLEMENTATION
- BLOCK-RECURSIVE PARALLEL MULTIPLICATION OF MATRIXES
- PARALLELIZATION PROBLEMS IN SOME LOCAL TASKS
- COMPUTING EXPERIMENT ON MULTIPROCESSOR SYSTEMS: ALGORITHMS AND TOOL
- NONLINEAR EFFECTS IN CONTROL SYSTEMS OF COMPLEX DYNAMIC OBJECTS
- AUTOMATIC PROGRAMMING AND PARALLEL CALCULATIONS
- INTELLIGENT TECHNOLOGIES FOR MASS MOBILE SERVICES DESIGN AND DEVELOPMENT
- ADAPTIVE PARALLEL COMPUTATIONS FOR MULTIDIMENSIONAL MULTIEXTREME OPTIMIZATION
- MODEL OF 1/f-NOISE APPEARANCE AS A RESULT OF POISSON PROCESS
- INTELLIGENT INTERACTION IN DISTRIBUTED INFORMATION ENVIRONMENT