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)

zbMATH Keywords

constrained optimizationdescent directionLagrangianspeed of convergencelinearization of appropriate active constraints

Mathematics Subject Classification ID

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

Cited in

(2)

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

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)