On consistency of bounding operations in deterministic global optimization

DOI10.1007/BF00940850zbMath0642.90080MaRDI QIDQ1101343

Reiner Horst

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

global optimizationnonconvex programmingbranch-and-boundstrong consistencybounding proceduresconvex envelopes

Mathematics Subject Classification ID

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

Related Items

On solving general reverse convex programming problems by a sequence of linear programs and line searches, On solving a d.c. programming problem by a sequence of linear programs, Concave minimization via conical partitions and polyhedral outer approximation

Cites Work

• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Jointly Constrained Biconvex Programming
• Approximation to Optimization Problems: An Elementary Review
• An Algorithm for Separable Nonconvex Programming Problems