A reduction method for semi-infinite programming by means of a global stochastic approach

Optimization

Volumn 58, Issue 6, 2009, Pages 713-726

  Pereira, Ana I P N ^a   Fernandes, Edite M G P ^b  

^a INSTITUTO POLITÉCNICO DE BRAGANÇA   (Portugal)

^b UNIVERSITY OF MINHO   (Portugal)

Author keywords

Exponential function; Penalty method; Reduction method; Semi infinite programming; Simulated annealing

Indexed keywords

EID: 70450166936     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331930701764072     Document Type: Article

References (31)

1. I.D. Coope and G.A. Watson, A projected Lagrangian algorithm for semi-infinite programming, Math. Program. 32 (1985), pp. 337-356.
2. A. Corana, M. Marchesi, C. Martini, and S. Ridella, Minimizing multimodal functions of continuous variables with the "simulated annealing" algorithm, ACM Trans. Math. Softw. 13(1987), pp. 262-280.
3. A. Dekkers and E. Aarts, Global optimization and simulated annealing, Math. Program. 50 (1991), pp. 367-393.
4. R. Fletcher and S. Leyffer, Nonlinear programming without a penalty function, Math. Program. 91 (2002), pp. 239-269.
5. G. Gramlich, R. Hettich, and E.W. Sachs, Local convergence of SQP methods in semi-infinite programming, SIAM J. Optim. 5 (1995), pp. 641-658.
6. E. Haaren-Retagne, A semi-infinite programming algorithm for robot trajectory planning, Ph.D. thesis, Universitat Trier, Germany, Trier, 1992.
7. R. Hettich and W.V. Honstede, On quadratically convergent methods for Semi-Infinite Programming, in Semi-Infinite Programming, J. Stoer, ed., Springer-Verlag, Berlin, 1979, pp. 97-111.
8. R. Hettich and H.Th. Jongen, Semi-Infinite Programming: Conditions of Optimality and Applications, in Optimization Techniques, Part 2, Vol. 7, Springer, Berlin, pp. 1-11.
9. R. Hettich and K.O. Kortanek, Semi-infinite programming: Theory, methods and applications, SIAM Rev. 35 (1993), pp. 380-429.
10. L. Ingber, Adaptive simulated annealing (ASA): Lessons learned, Con. Cybern. 25 (1996), pp. 33-54.
11. H.Th. Jongen and J.-J. Ruckmann, On stability and deformation in semi-infinite optimization, semi-infinite programming, in Nonconvex Optimization and Its Applications, Vol. 25, R. Reemtsen and J.-J. Ruckmann, eds., Kluwer Academic Publishers, Boston, 1998, pp. 29-67.
12. W.B. Kort and D. Bertsekas, A new penalty function method for constrained minimization, in Proceedings of the1972IEEE Conference on Decision and Control, 1972, pp. 162-166.
13. T. Leon, S. Sanmatias, and H. Vercher, A multi-local optimization algorithm, Top 6 (1998), pp. 1-18.
14. J. Nocedal and S. Wright, Numerical Optimization, Springer Series in Operations Research, Springer, New York, 1999.
15. J.M. Ortega and W.C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
16. K. Parsopoulos, V. Plagianakos, G. Magoulas, and M. Vrahatis, Objective function stretching to alleviate convergence to local minima, Nonlinear Anal. 47(2001), pp. 3419-3424.
17. A.I. Pereira and E.M. Fernandes, A study of simulated annealing variants, in Proceedings of the XXVIII Congreso Nacional de EstadȂstica e Investigacion Operativa, Cadiz, (2004) ISBN 84-609-0438-5.
18. A.I. Pereira and E.M. Fernandes, A new algorithm to identify all global maximizers based on simulated annealing, in Proceedings of the 6th World Congress on Structural and Multidisciplinary Optimization, J. Herskowitz, S. Mazorche, and A. Canelas, eds., ISBN: 85-285-0070-5 (CD-ROM), 2005.
19. C.J. Price, Non-linear semi-infinite programming, Ph.D. thesis, University of Canterbury, Christchurch, New Zealand, 1992.
20. C.J. Price and I.D. Coope, An exact penalty function algorithm for semi-infinite programmes, BIT 30 (1990), pp. 723-734.
21. C.J. Price and I.D. Coope, Numerical experiments in semi-infinite programming, Comput. Optim. Appl. 6 (1996), pp. 169-189.
22. R. Reemtsen and S. Gorner, Numerical methods for semi-infinite programming: A survey, semi-infinte programming, in Nonconvex Optimizaion and Its Applications, Vol. 25, R. Reemtsen and J.-J. Ruckmann, eds., Kluwer Academic Publishers, Boston, 1998, pp. 195-275.
23. R. Reemtsen and J.-J. Ruckmann (eds.), Semi-infinite programming, in Nonconvex Optimization and its Applications, Kluwer Academic Publishers, Boston, 1998.
24. H. Romeijn and R. Smith, Simulated annealing for constrained global optimization, J. Global Optim. 5 (1994), pp. 101-126.
25. O. Stein, Bi-level strategies in semi-infinite programming, in Nonconvex Optimization and Its Applications, Vol. 71, Kluwer Academic, Norwell, MA, 2003.
26. H. Szu and R. Hartley, Fast simulated annealing, Phys. Lett. A 122 (1987), pp. 157-162.
27. Y. Tanaka, M. Fukushima, and T. Ibaraki, A comparative study of several semiinfinite nonlinear programmnig algorithms, Euro. J. Oper. Res. 36 (1988), pp. 92-100.
28. Y. Tanaka, M. Fukushima, and T. Ibaraki, A globally convergence SQP method for semi-infinite non-linear optimization, J. Comput. Appl. Math. 23 (1988), pp. 141-153.
29. A.I.F. Vaz, E.M.G.P. Fernandes, and M.P.S.F. Gomes, Discretization methods for semi-infinite programming, Investigacao Oper. 21 (2001), pp. 37-46.
30. G.A. Watson, Globally convergent methods for semi-infinite programming, BIT 21 (1981), pp. 362-373.
31. G.A. Watson, Numerical experiments with globally convergent methods for semi-infinite programming problems, in Semi-Infinite Programming and Applications, A.V. Fiacco and K.O. Kortanek, eds., Springer Verlag, Berlin, 1983, pp. 193-205.