On a method of simplex embeddings in convex programming.
The authors consider the problem \(\min\{ \varphi(x): x \in R \}\), \(R=\{ x \in E^n: q_j (x)\leq 0, j=1, 2, \dots, m \}\), where \(\varphi(x)\) and \(q_j(x)\), \(j=1, 2, \dots, m\) are quasi--convex functions, and \(R\) satisfies the regularity condition. A well-known approach to approximation of a solution \(x^*\) of the problem consists in constructing a sequence of ellipsoids or polyhedra \(R^k \ni x^*\) such that \(\text{meas}(R^k) \to 0\) as \(k \to \infty\). In this paper the authors suggest a new algorithm of constructing a sequence of approximating polyhedra \(R^k\).
- A method for approximating the solution set of a system of convex inequalities by polytopes
- A modified simplex immersions method with simultaneous introduction of several intersecting planes
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- On implementation of a self-dual embedding method for convex programming
- An algorithm for linearizing convex extremal problems
- scientific article; zbMATH DE number 4079167 (Why is no real title available?)
- An algorithm of simplex imbeddings in convex programming
- scientific article; zbMATH DE number 2012178 (Why is no real title available?)
- The external estimate of the compact set by Lebesgue set of the convex function
- Methods of support cones and simplices in convex programming and their applications to physicochemical systems
- A base reduction method for convex programming
This page was built for publication: On a method of simplex embeddings in convex programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1432468)
