Global optimization under Lipschitzian constraints

DOI10.1007/BF03167774zbMath0622.90070OpenAlexW2135154756MaRDI QIDQ3760303

Phan Thien Thach, Hoang Tuy

Publication date: 1987

Published in: Japan Journal of Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationconcave minimizationd.c. programmingouter approximation algorithmreverse convex constraintLipschitzian constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

D.c sets, d.c. functions and nonlinear equations, Global optimization conditions for certain nonconvex minimization problems, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, The design centering problem as a d.c. programming problem, On-line and off-line vertex enumeration by adjacency lists, An analytical approach to global optimization, On an outer approximation concept in global optimization, Convex minimization under Lipschitz constraints, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications

Cites Work

• An outer approximation method for globally minimizing a concave function over a compact convex set
• On outer approximation methods for solving concave minimization problems
• Convex programs with an additional reverse convex constraint
• The design centering problem as a d.c. programming problem
• Outer approximation algorithm for nondifferentiable optimization problems
• Unnamed Item
• Unnamed Item