Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming

DOI10.3103/S1066369X07060023MaRDI QIDQ941241zbMATH OpenFDO

Authors T. I. Belykh, Valerian Bulatov

Publication date 4 September 2008

Published in Russian Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S1066369X07060023

Mathematics Subject Classification ID

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

Review text

An immersion method for the numerical solution of convex programming problems is presented applying inverse problems in mathematical programming. It is shown that the Heward method of centers [\textit{V.P. Bulatov}, in: Methods of numerical analysis and optimization, Work Collect., Novosibirsk 1987, 133--157 (1987; Zbl 0633.90062)] is enclosed in the given method.

Recommendations

• scientific article; zbMATH DE number 2000319
• Numerical methods for solution of the multiextremal problems connected with the inverse mathematical programming problems
• Inverse problems of mathematical programming. Global optimization methods.
• scientific article; zbMATH DE number 617915
• Inverse extremal problems and methods of their solution

Cited in

(5)

• Numerical methods for solution of the multiextremal problems connected with the inverse mathematical programming problems
• scientific article; zbMATH DE number 2000319 (Why is no real title available?)
• On several algorithms of immersion - cutoff for the problem of mathematical programming
• scientific article; zbMATH DE number 7742927 (Why is no real title available?)
• Optimization of the optimal value function in problems of convex parametric programming

This page was built for publication: Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming

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