Iterative algorithm for mathematical programming problems with preconvex constraints

DOI10.1134/S0965542510050040MaRDI QIDQ2995908zbMATH OpenFDO

Authors

Publication date 4 May 2011

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

convex programmingnecessary conditions for a local minimumpreconvex setconvergence of iteration algorithm

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 2208704
• scientific article; zbMATH DE number 2210576
• An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
• Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set
• The method of feasible directions for mathematical programming problems with preconvex constraints

Cited in

(9)

• Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint
• Newton's method for minimizing a convex twice differentiable function on a preconvex set
• Multiplicative iterative algorithms for convex programming
• A relaxation method for minimizing a smooth function on a generalized spherical segment
• scientific article; zbMATH DE number 1533655 (Why is no real title available?)
• scientific article; zbMATH DE number 2208704 (Why is no real title available?)
• scientific article; zbMATH DE number 2210576 (Why is no real title available?)
• The method of feasible directions for mathematical programming problems with preconvex constraints
• Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set

This page was built for publication: Iterative algorithm for mathematical programming problems with preconvex constraints

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