|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1990, Volume 30, Number 2, Pages 217–230
(Mi zvmmf3305)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Reduced-direction methods with feasible points in nonlinear programming
V. S. Izhutkin, M. Yu. Kokurin Ioshkar-Ola
Abstract:
An approach to the construction of feasible direction type methods of nonlinear programming is proposed. The approach relies on linearization of the active constraints, which reduces the problem of choosing a direction of descent of the objective function inside the feasible region to an unconstrained direction-choosing problem for an auxiliary function in a lower-dimensional space. The approach is developed for problems with inequality constraints and extended to problems with both inequality and equality constraints.
Received: 17.08.1988 Revised: 24.07.1989
Citation:
V. S. Izhutkin, M. Yu. Kokurin, “Reduced-direction methods with feasible points in nonlinear programming”, Zh. Vychisl. Mat. Mat. Fiz., 30:2 (1990), 217–230; U.S.S.R. Comput. Math. Math. Phys., 30:1 (1990), 159–169
Linking options:
https://www.mathnet.ru/eng/zvmmf3305 https://www.mathnet.ru/eng/zvmmf/v30/i2/p217
|
Statistics & downloads: |
Abstract page: | 242 | Full-text PDF : | 111 | References: | 60 | First page: | 1 |
|