Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices
From MaRDI portal
Publication:3115685
Recommendations
- A gradient projection method on an embedding of the feasible set
- Method of orthogonal simplexes and its applications to convex programming
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- An algorithm of simplex imbeddings in convex programming
- scientific article; zbMATH DE number 2102650
Cited in
(8)- scientific article; zbMATH DE number 2102650 (Why is no real title available?)
- A new self-dual embedding method for convex programming
- An algorithm of simplex imbeddings in convex programming
- Embedding of a homothete in a convex compactum: an algorithm and its convergence
- A gradient projection method on an embedding of the feasible set
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- 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
This page was built for publication: Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115685)
