|
St. Petersburg Polytechnical University Journal. Computer Science. Telecommunication and Control Systems, 2014, Issue 4(200), Pages 69–78
(Mi ntitu50)
|
|
|
|
Simulations of Computer, Telecommunications, Control and Social Systems
Sequence relaxation methods for stiff optimization problems
I. G. Chernorutskiy St. Petersburg State Polytechnical University
Abstract:
New sequence relaxation methods are discussed. In contrast to the classical relaxation procedures, the methods retain the convergence and efficiency for non-convex nonlinear programming problems under conditions of high stiffness of target functionals.
Keywords:
sequence relaxation methods, non-convex optimization problems, stiff functionals.
Citation:
I. G. Chernorutskiy, “Sequence relaxation methods for stiff optimization problems”, St. Petersburg Polytechnical University Journal. Computer Science. Telecommunication and Control Sys, 2014, no. 4(200), 69–78
Linking options:
https://www.mathnet.ru/eng/ntitu50 https://www.mathnet.ru/eng/ntitu/y2014/i4/p69
|
Statistics & downloads: |
Abstract page: | 148 | Full-text PDF : | 133 |
|