Method of orthogonal simplexes and its applications to convex programming

DOI10.1134/S0965542508040064;zbMATH Open1164.90382MaRDI QIDQ3545162FDOQ3545162

Valerian Bulatov

Publication date: 9 December 2008

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

zbMATH Keywords

embedding methodsconvex manifoldorthogonal simplexesproblems of convex programming

Mathematics Subject Classification ID

Convex programming (90C25)

Cited In (7)

• Orthogonalizing linear operators in convex programming. I, II
• Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method
• A simple method for convex optimization in the oracle model
• A forward convex-simplex method
• Some \(LP\) algorithms using orthogonal matrices
• The method of convex programming with a prescribed absolute-relative error
• Application of orthogonal transformations in the revised simplex method

This page was built for publication: Method of orthogonal simplexes and its applications to convex programming

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