scientific article; zbMATH DE number 1533655
The article is devoted to studying the following mathematical programming problem: minimize a function \(f_0(x)\) under the restrictions \(f_1(x)\leq 0\), \(\dots\), \(f_m(x)\leq 0\). Here \(x\in \mathbb R^n\), \(f_0(x)\), \(f_1(x),\dots f_m(x)\) are continuously differentiable convex functions. The problem is rewritten as follows: \(f_0(x) - l_k\leq 0\), \(f_1(x)\leq 0\), \(\dots\), \(f_m(x)\leq 0\), \(\lim_{k\to\infty} l_k =\gamma_0\), where \(l_0 = \Delta\gamma\) and \(\gamma = \min\{f_0(x) \quad f_1(x)\leq 0\), \(\dots\), \(f_m(x)\leq 0\}\). For solving the problem, the author exposes a new algorithm consisting in two steps. First, unsolvability of the problem is verified and, next, in the case of solvability, an optimal solution is found. For the entire collection see [Zbl 0932.00035].
- On reduction of the quasi-convex programming problem to problem of unconstrained minimization by method of conical projection
- scientific article; zbMATH DE number 3847229
- Publication:3200896
- Iterative algorithm for mathematical programming problems with preconvex constraints
- scientific article; zbMATH DE number 4070639
- On reduction of the quasi-convex programming problem to problem of unconstrained minimization by method of conical projection
- On the application of the flexible polyhedron method to solve mathematical programming problems
- scientific article; zbMATH DE number 4176848 (Why is no real title available?)
- On a relation between problems of calculus of variations and mathematical programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517003)