Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization-Reference-Cited by-同舟云学术

Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization

Published:1988-07 Issue:1 Volume:58 Page:11-37
ISSN:0022-3239
Container-title:Journal of Optimization Theory and Applications
language:en
Short-container-title:J Optim Theory Appl

Author:

Horst R.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF00939768.pdf

Reference37 articles.

1. Falk, J., andSoland, R. M.,An Algorithm for Separable Nonconvex Programming Problems, Management Science, Vol. 15, pp. 550?569, 1969.

2. Horst, R.,An Algorithm for Nonconvex Programming Problems, Mathematical Programming, Vol. 10, pp. 312?321, 1976.

3. Horst, R.,A Note on the Convergence of an Algorithm for Nonconvex Programming Problems, Mathematical Programming, Vol. 19, pp. 237?238, 1980.

4. Benson, H. P.,On the Convergence of Two Branch-and-Bound Algorithms for Nonconvex Programming Problems, Journal of Optimization Theory and Applications, Vol. 36, pp. 129?134, 1982.

5. Benson, H. P.,A Finite Algorithm for Concave Minimization over a Polyhedron, Naval Research Logistic Quarterly, Vol. 32, pp. 165?177, 1985.

Cited by 63 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Successive Linear Relaxation Method for MINLPs with Multivariate Lipschitz Continuous Nonlinearities;Journal of Optimization Theory and Applications;2023-07-23

2. Image Space Accelerating Algorithm for Solving a Class of Multiplicative Programming Problems;Mathematical Problems in Engineering;2022-07-20

3. The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities;Optimization Letters;2021-11-25

4. Intersection Disjunctions for Reverse Convex Sets;Mathematics of Operations Research;2021-10-01

5. A decomposition method for MINLPs with Lipschitz continuous nonlinearities;Mathematical Programming;2018-06-23