An approximate method for solving the convex programming problem

DOI10.1007/BF01095755MaRDI QIDQ684670zbMATH OpenOpenAlexFDO

Authors M. I. Zhaldak, Yu. V. Trius

Publication date 12 December 1993

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01095755

zbMATH Keywords

real Hilbert spaceconvex nondifferentiable functionalstability of the approximate solutions

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48)

Recommendations

• A numerical method of nondifferentiable convex optimization with constraints
• scientific article; zbMATH DE number 3850830
• scientific article; zbMATH DE number 3887443
• An exterior point method for the convex programming problem
• Iterative linear programming solution of convex programs

Cited in

(13)

• A numerical method of nondifferentiable convex optimization with constraints
• Inner approximation method for a reverse convex programming problem
• Convex integration: a method of approximate solutions
• An approximate decomposition algorithm for convex minimization
• scientific article; zbMATH DE number 4130198 (Why is no real title available?)
• Constructing convex solutions via Perron's method
• scientific article; zbMATH DE number 5064899 (Why is no real title available?)
• A method for solving reverse convex programming problems
• scientific article; zbMATH DE number 590870 (Why is no real title available?)
• scientific article; zbMATH DE number 3920203 (Why is no real title available?)
• scientific article; zbMATH DE number 6135095 (Why is no real title available?)
• scientific article; zbMATH DE number 3892943 (Why is no real title available?)
• A forward convex-simplex method

This page was built for publication: An approximate method for solving the convex programming problem

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