On consistency of bounding operations in deterministic global optimization
- 1 April 1989
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 61 (1) , 143-146
- https://doi.org/10.1007/bf00940850
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimizationJournal of Optimization Theory and Applications, 1988
- Approximation to Optimization Problems: An Elementary ReviewMathematics of Operations Research, 1986
- Jointly Constrained Biconvex ProgrammingMathematics of Operations Research, 1983
- An Algorithm for Separable Nonconvex Programming ProblemsManagement Science, 1969