The method of feasible directions for mathematical programming problems with preconvex constraints
From MaRDI portal
Publication:3499909
DOI10.1134/S0965542508020073zbMath1224.90133OpenAlexW2033599966MaRDI QIDQ3499909
T. F. Minnibaev, V. I. Zabotin
Publication date: 3 June 2008
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542508020073
convergencemathematical programming with preconvex constraintsnumerical method of feasible directions
Related Items (2)
Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set ⋮ Newton's method for minimizing a convex twice differentiable function on a preconvex set
This page was built for publication: The method of feasible directions for mathematical programming problems with preconvex constraints
