Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques-Reference-Cited by-同舟云学术

Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques

Published:2003-12 Issue:3 Volume:119 Page:421-457
ISSN:0022-3239
Container-title:Journal of Optimization Theory and Applications
language:en
Short-container-title:Journal of Optimization Theory and Applications

Author:

Polak E.,Royset J. O.

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.1023/B:JOTA.0000006684.67437.c3.pdf

Reference25 articles.

1. Cheng, C. K., Deng, X., Liao, Y. Z., and Yao, S. Z., Symbolic Layout Compaction under Conditional Design Rules, IEEE Transactions on Computer-Aided Design, Vol. 11, pp. 475-486, 1992.

2. Hochbaum, D., Complexity and Algorithms for Logical Constraints with Applications to VLSI Layout, Compaction, and Clocking, Studies in Locational Analysis, Proceedings of ISOLDE VI, pp. 159-164, 1993.

3. Moh, T. S., Chang, T. S., and Hakimi, S. L., Globally Optimal Floorplanning for a Layout Problem, IEEE Transactions on Circuits and Systems, I: Fundamental Theory and Applications, Vol. 43, pp. 713-720, 1996.

4. Chen, T., and Fan, M. K. H., On Convex Formulation of the Floor-Plan Area Minimization Problem, Proceedings of the International Symposium on Physical Design, Monterey, California, pp. 124-128, 1998.

5. Kassim, A. A., and Vijaya Kumar, B. V. K., Path Planning for Autonomous Robots Using Neural Networks, Journal of Intelligent Systems, Vol. 7, pp. 33-55, 1997.

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

1. A new nonmonotone line search method for nonsmooth nonconvex optimization;Optimization;2022-08-10

2. Global Solution of Semi-infinite Programs with Existence Constraints;Journal of Optimization Theory and Applications;2021-02-08

3. Discrete Gradient Methods;Numerical Nonsmooth Optimization;2020

4. A new trust region method for nonsmooth nonconvex optimization;Optimization;2018-05-07

5. An effective adaptive trust region algorithm for nonsmooth minimization;Computational Optimization and Applications;2018-03-30