An algorithm of simplex imbeddings in convex programming
From MaRDI portal
Recommendations
- On a method of simplex embeddings in convex programming.
- scientific article; zbMATH DE number 617915
- Method of orthogonal simplexes and its applications to convex programming
- Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices
- scientific article; zbMATH DE number 4070639
Cited in
(11)- scientific article; zbMATH DE number 2190131 (Why is no real title available?)
- scientific article; zbMATH DE number 4070639 (Why is no real title available?)
- On a method of simplex embeddings in convex programming.
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices
- Methods of support cones and simplices in convex programming and their applications to physicochemical systems
- Method of orthogonal simplexes and its applications to convex programming
- Simplex-inspired algorithms for solving a class of convex programming problems
- On implementation of a self-dual embedding method for convex programming
- The solution of the convex combination problem
- A simplicial algorithm for concave minimization and its performance as a heuristic tool
This page was built for publication: An algorithm of simplex imbeddings in convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818135)
