On the constructive solution of convex programming problems in separable form

DOI10.1023/B:JOTH.0000013564.04407.82MaRDI QIDQ1776278zbMATH OpenFDO

Authors Tatiana V. Tchemisova

Publication date 23 May 2005

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:JOTH.0000013564.04407.82

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Applications of the method of partial inverses to convex programming: Decomposition
• A two-segment approximation algorithm for separable convex programming with linear constraints
• Successive approximation in separable programming: An improved procedure for convex separable programs
• Separable programming. Theory and methods
• scientific article; zbMATH DE number 4130198

Cited in

(2)

• Constructing convex solutions via Perron's method
• Explicit model of dual programming and solving method for a class of separable convex programming problems

This page was built for publication: On the constructive solution of convex programming problems in separable form

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