Advertisement

Smoothing Techniques for the Solution of Finite and Semi-Infinite Min-Max-Min Problems

  • Elijah Polak
Chapter
Part of the Applied Optimization book series (APOP, volume 82)

Abstract

Semi-infinite optimization problems with max-min cost or constraint functions, such as P: minx∈IR n maxy∈Y min z∈Z ø (x, y, z), occur in several important areas of engineering design, as well as in economics. These problems are particularly difficult, partly because of the concatenation of max and min operators, and partly because functions of the form max y∈Y minz∈Z ø (x, y, z) may fail to have directional derivatives even when ø (x, y, z) is smooth. As a result, the literature dealing rigorously with their solution is very small. First we develop a first-order optimality function θ(.) for such problems. Then we show that one can use an adaptive smoothing technique to construct a sequence of finite min-max problems, of the form P N : minx∈IR nmaxy∈YN ω N (x, y), which, together with their optimality functions θ N (.) are consistent approximations to the the original pair (P, θ). This fact opens up the possibility of solving minmax-min problems using a master algorithm that calls min-max algorithms as subroutines.

Keywords

min-max-min problems semi-infinite optimization lower-Dini stationarity non-smooth optimization floor planning tolerancing and tuning obstacle avoidance 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.W. Sandler, P. C. Liu, and H. Tromp, A nonlinear programming approach to optimal design centering, tolerancing, and tuning, IEEE Transactions on Circuits and Systems, Vol. CAS-23 (1976), 155–165.CrossRefGoogle Scholar
  2. [2]
    D. Barbara, H. Garcia-Molina, and A. Spauster, Increasing availability under mutual exclusion constraints with dynamic vote reassignment. ACM Transactions on Computer Systems, Vol. 7, No. 4 (1989), 394–426.CrossRefGoogle Scholar
  3. [3]
    D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.zbMATHGoogle Scholar
  4. [4]
    T. Chen and M. K. H. Fan, On convex formulation of of the floor-plan area minimization problem, in Proc. International Symposium on Physical Design, (1998) 124–128.Google Scholar
  5. [5]
    C. K. Cheng, X. Deng, Y. Z. Liao, and S. Z. Yao, Symbolic layout compaction under conditional design rules, IEEE Transactions on Computer Aided-Design, Vol. 11, No. 4 (1992), 4775–486.Google Scholar
  6. [6]
    F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley-Interscience, N.Y. (1983).zbMATHGoogle Scholar
  7. [7]
    J. Gaal, L. Gefferth, K. Geher, E. Halasz, and T. Tron, New algorithms and computer programs for design centering, tolerancing and tuning under environmental influence, Proceedings of the 1981 European Conference on Circuit Theory and Design, The Hague, Netherlands (25–28 Aug. 1981). Delft, Netherlands, Delft University Press (1981), 696–703.Google Scholar
  8. [8]
    A. Giva, F. Dicesare, and M. Silva, Petri net supervisors for generalized mutual exclusion constraints, Proceeding of the 12th Triennial World Congress of the International Federation of Automatic Control, Vol. 4. Applications II, Sydney, NSW, Australia, 18–23 July 1993, 379–82.Google Scholar
  9. [9]
    D. Hochbaum, Complexity and algorithms for logical constraints with applications to VLSI layout, compaction and clocking, Studies in Locational Analysis, ISOLDE VI, Proceedings (June 1993), 159–164.Google Scholar
  10. [10]
    K. Karplus, Exclusion constraints for digital MOS circuits: a new set of electrical design rules, em Proceedings of the IEEE International Conference on Computer-Aided Design: ICCAD-85. Digest of Technical Papers (Cat. No. 85CH2233–5), Santa Clara, CA, USA, 18–21 Nov. 1985.Google Scholar
  11. [11]
    A. A. Kassim and B. V. K. Vijaya Kumar, Path planning for autonomous robots using neural networks, Journal of Intelligent Systems, Vol. 7, No. 1–2, (1997) 33–55.CrossRefGoogle Scholar
  12. [12]
    C. Kirjner and E. Polak, On the conversion of optimization problems with maxmin constraints to standard optimization problems, SIAM J. Optimization, Vol. 8, No. 4 (1998), 887–915.zbMATHCrossRefGoogle Scholar
  13. [13]
    S. H. Koozekanani and R. B. McGhee, Occupancy problems with pairwise exclusion constraints-an aspect of gait enumeration, Journal of Cybernetics, Vol. 2, No. 4 (1972), 14–26.MathSciNetCrossRefGoogle Scholar
  14. [14]
    P. C. Liu, V.W. Chung, and K. C. Li, Circuit design with post-fabrication tuning, Proceedings of the 35th Midwest Symposium on Circuits and Systems, Washing-ton, DC, USA (Aug. 1992), 344–347.CrossRefGoogle Scholar
  15. [15]
    R. W. Longman, V. H. Schulz, and H. G. Bock, Path planning for satellite mounted robots, in Dynamics and Control of Structures in Space III, C. L. Kirk, and D. J. Inman, eds, Comput. Mech. Publications (1996), Southampton, UK, 17–28.Google Scholar
  16. [16]
    D. Q. Mayne and A. Voreadis, Algorithms for the tolerancing and tuning problem, Proceedings of the 1981 European Conference on Circuit Theory and Design, The Hague, Netherlands (25–28 Aug. 1981). Delft, Netherlands, Delft University Press (1981), 753–757.Google Scholar
  17. [17]
    D. Q. Mayne and E. Polak, Algorithms for Optimization Problems with Exclusion Constraints, J. Optimization Theory and Applications, Vol. 51, No. 3, (1986), 453--474.MathSciNetzbMATHCrossRefGoogle Scholar
  18. [18]
    T. S. Moh, T. S. Chang, and S. L. Hakimi, Globally optimal floorplanning for a layout problem, IEEE Trans. on Circuits and Systems - I, Fundamental Theory and Applications, Vol. 43, (1996), 713–720.MathSciNetCrossRefGoogle Scholar
  19. [19]
    O. Pironneau and E. Polak, On the rate of convergence of certain methods of centers, Mathematical Programming, Vol. 2, No. 2, pp. 230–258, 1972.MathSciNetzbMATHCrossRefGoogle Scholar
  20. [20]
    E. Polak, On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems, Mathematical Programming, Series B, Vol. 82, No.2, pp. 385–414, 1993.MathSciNetCrossRefGoogle Scholar
  21. [21]
    E. Polak, Optimization: Algorithms and Consistent Approximations, Springer-Verlag, New York (1997).zbMATHGoogle Scholar
  22. [22]
    E. Polak and A. Sangiovanni Vincentelli, Theoretical and computational aspects of the optimal design centering, tolerancing and tuning problem, IEEE Transactions on Circuits and Systems, Vol. CAS-26, No. 9 (1979), 795–813.CrossRefGoogle Scholar
  23. [23]
    B. N. Pshenichnyi, and Yu. M. Danilin, Numerical Methods in Extremal Problems (Chislennye Metody y Ekstremal’nykh Zadachakh),Nauka, Moscow, 1975.Google Scholar
  24. [24]
    D. Ralph and E. Polak, A first-order algorithm for semi-infinite min-max-min problems, SIAM J. Optimization, in press.Google Scholar
  25. [25]
    J. A. Reeds and L. A. Shepp, Optimal paths for a car that goes both forwards and backwards, Pacific Journal of Mathematics, Vol. 145, No. 2 (1990).Google Scholar
  26. [26]
    R. T. Rockafellar and R. J-B. Wets, Variational Analysis, Springer-Verlag, New York, 1997.Google Scholar
  27. [27]
    H. Scheel and S. Scholtes, Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity, Mathematics of Operations Research, 25, 1–22.Google Scholar
  28. [28]
    S. Scholtes, Introduction to piecewise differentiable equations,Habilitation Thesis, Preprint No. 53/1994, Institut für Statistik und Mathematische Wirtschaftstheorie, Universität Karlsruhe (76128 Karlsruhe, 1994).Google Scholar
  29. [29]
    A. Tits, On the optimal design centering, tolerancing and tuning problem, Journal of Optimization Theory and Its Applications, Vol. 45, No. 3 (1985), 487–494.MathSciNetzbMATHCrossRefGoogle Scholar
  30. [30]
    A. Voreadis and D. Q. Mayne, “Cut Map Algorithm for Design Problems with Parameter Tolerances and tuning,” IEEE Transactions on Circuits and Systems, Vol. CAS-29, No. 5, pp. 288–298, 1982.MathSciNetCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers B.V. 2003

Authors and Affiliations

  • Elijah Polak
    • 1
  1. 1.Department of Electrical Engineering and Computer SciencesUniversity of CaliforniaBerkeleyUSA

Personalised recommendations