Reduced-direction methods with feasible points in nonlinear programming

DOI10.1016/0041-5553(90)90025-NMaRDI QIDQ5752295zbMATH OpenFDO

Authors V. S. Izhutkin, Mikhail Yu. Kokurin

Publication date 1990

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(90)90025-N

zbMATH Keywords

constrained optimizationdescent directionLagrangianlinearization of appropriate active constraintsspeed of convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonlinear programming (90C30)

Cited in

(2)

• Methods of reduced directions, based on a differentiable penalty function, for a problem of nonlinear programming
• scientific article; zbMATH DE number 4143788 (Why is no real title available?)

This page was built for publication: Reduced-direction methods with feasible points in nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5752295)