Two alternatives for the cubic algorithm

DOI10.1016/0022-247X(87)90088-6MaRDI QIDQ1095036zbMATH OpenOpenAlexFDO

Authors E. A. Galperin

Publication date 1987

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-247x(87)90088-6

zbMATH Keywords

approximate solutionscubic algorithmnon-convexnon-robust

Mathematics Subject Classification ID

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

Review text

Two alternatives are proved that allow application of the cubic algorithm for finding approximate solutions of the general non-convex and non- robust mathematical programming problem.

Cites work

• A linear algorithm for determining the separation of convex polyhedra
• The cubic algorithm

Cited in

(7)

• The cubic algorithm
• The Beta-algorithm
• The fast cubic algorithm
• Global optimization to prescribed accuracy
• The integer cubic algorithm
• When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
• Integral global optimization method for differential games with application to pursuit-evasion games

This page was built for publication: Two alternatives for the cubic algorithm

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