A nonrelaxation process in feasible direction methods

DOI10.1007/BF01097135MaRDI QIDQ1124284zbMATH OpenOpenAlexFDO

Authors E. V. Lyamin

Publication date 1989

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01097135

zbMATH Keywords

convergenceconvex programmingmethod of feasible directionsnon- relaxational process

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Review text

See the review in Zbl 0575.65062.

Cites work

• Convergence of random-search method for finding stationary points in the general nonlinear programming problem
• scientific article; zbMATH DE number 3179979 (Why is no real title available?)

This page was built for publication: A nonrelaxation process in feasible direction methods

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