This article is cited 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.

UDC: 519.853.6

MSC: Primary 90C30; Secondary 65K05

Received: 17.08.1988
Revised: 24.07.1989

 English version: USSR Computational Mathematics and Mathematical Physics, 1990, 30:1, 159–169

Bibliographic databases:

• 
•