A nonrelaxation process in feasible direction methods

DOI10.1007/BF01097135zbMath0678.65043OpenAlexW1995427716MaRDI QIDQ1124284

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)

Cites Work

• Convergence of random-search method for finding stationary points in the general nonlinear programming problem
• Unnamed Item

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