Global optimization under Lipschitzian constraints

DOI10.1007/BF03167774MaRDI QIDQ3760303zbMATH OpenOpenAlexFDO

Authors 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

concave minimizationd.c. programmingglobal optimizationLipschitzian constraintsouter approximation algorithmreverse convex constraint

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for global optimization of Lipschitz continuous functions
• scientific article; zbMATH DE number 757681
• An algorithm for solving global optimization problems with nonlinear constraints
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• Convex minimization under Lipschitz constraints

Cites work

• An outer approximation method for globally minimizing a concave function over a compact convex set
• Convex programs with an additional reverse convex constraint
• scientific article; zbMATH DE number 4011808 (Why is no real title available?)
• scientific article; zbMATH DE number 3370185 (Why is no real title available?)
• On outer approximation methods for solving concave minimization problems
• Outer approximation algorithm for nondifferentiable optimization problems
• The design centering problem as a d.c. programming problem

Cited in

(28)

• An algorithm for global optimization of Lipschitz continuous functions
• 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
• The complexity of the computation of a global minimum in certain classes of optimization problems
• On-line and off-line vertex enumeration by adjacency lists
• An analytical approach to global optimization
• An application of Lipschitzian global optimization to product design
• On using estimates of Lipschitz constants in global optimization
• Global optimization conditions for certain nonconvex minimization problems
• Global optimization in Hilbert space
• Convex minimization under Lipschitz constraints
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
• D.c sets, d.c. functions and nonlinear equations
• On solving general reverse convex programming problems by a sequence of linear programs and line searches
• An implicit enumeration method for global optimization problems
• Cutting angle method – a tool for constrained global optimization
• scientific article; zbMATH DE number 4215287 (Why is no real title available?)
• scientific article; zbMATH DE number 5707333 (Why is no real title available?)
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• scientific article; zbMATH DE number 4062842 (Why is no real title available?)
• On an outer approximation concept in global optimization
• scientific article; zbMATH DE number 617933 (Why is no real title available?)
• Constrained, global optimization of unknown functions with Lipschitz continuous gradients
• Global optimization in metric spaces with partial orders
• Extended cutting angle method of global optimization
• Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
• A new global optimization method for univariate constrained twice-differentiable NLP problems

This page was built for publication: Global optimization under Lipschitzian constraints

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