Iterative algorithm for mathematical programming problems with preconvex constraints
From MaRDI portal
Publication:2995908
DOI10.1134/S0965542510050040zbMath1224.90132MaRDI QIDQ2995908
No author found.
Publication date: 4 May 2011
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
convex programmingnecessary conditions for a local minimumpreconvex setconvergence of iteration algorithm
Related Items (4)
Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint ⋮ A relaxation method for minimizing a smooth function on a generalized spherical segment ⋮ Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set ⋮ Newton's method for minimizing a convex twice differentiable function on a preconvex set
This page was built for publication: Iterative algorithm for mathematical programming problems with preconvex constraints
