On a method of simplex embeddings in convex programming.

MaRDI QIDQ1432468zbMATH OpenFDO

Authors T. I. Belykh, Valerian Bulatov

Publication date 15 June 2004

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

polyhedronregularity conditionquasi-convex functionembedding methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 2012178
• An algorithm of simplex imbeddings in convex programming
• Approximation of convex functions by projections of polyhedra
• scientific article; zbMATH DE number 617915
• scientific article; zbMATH DE number 3936940

Cited in

(9)

• A base reduction method for convex programming
• An algorithm of simplex imbeddings in convex programming
• scientific article; zbMATH DE number 2012178 (Why is no real title available?)
• scientific article; zbMATH DE number 4079167 (Why is no real title available?)
• The external estimate of the compact set by Lebesgue set of the convex function
• An algorithm for linearizing convex extremal problems
• On implementation of a self-dual embedding method for convex programming
• 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

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)