SIPAMPL: Semi-infinite programming with AMPL

ACM Transactions on Mathematical Software

Volumn 30, Issue 1, 2004, Pages 47-61

  Vaz, A Ismael F ^a   Fernandes, Edite M G P ^a   Gomes, M Paula S F ^b  

^a UNIVERSITY OF MINHO   (Portugal)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Evaluation tools; Semi infinite programming; Test problems

Indexed keywords

EVALUATION TOOLS; MATHEMATICAL PROGRAMMING PROBLEMS; SEMI-INFINITE PROGRAMMING (SIP); TEST PROBLEMS;

COMPUTER PROGRAMMING LANGUAGES; DATABASE SYSTEMS; ENCODING (SYMBOLS); FUNCTIONS; LINEAR EQUATIONS; NONLINEAR EQUATIONS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

COMPUTER PROGRAMMING;

EID: 2442460123     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/974781.974784     Document Type: Article

References (45)

1. ADLER, I., RESENDE, M., VEIGA, G., AND KARMARKAR, N. 1989. An implementation of Karmarkar's algorithm for linear programming. Math. Prog. 44, 297-335.
2. ANDERSON, E. AND LEWIS, A. 1989. An extension of the simplex algorithm for semi-infinite linear programming. Math. Prog. 44, 247-269.
3. BLANKENSHIP, J. AND FALK, J. 1976. Infinitely constrained optimization problems. J. Optim. Theory Applic. 19, 2 (June), 261-281.
4. BONGARTZ, I., CONN, A., GOULD, N., AND TOINT, P. 1995. CUTE: Constrained and Unconstrained Testing Environment. ACM Trans. Math. Soft. 21, 1, 123-160. ftp://130.246.9.91/pub/cute.
5. COLEMAN, T., BRANCH, M., AND GRACE, A. 1999. Optimization Toolbox for Use with MATLAB. The MathWorks Inc.
6. COOPE, I. AND WATSON, G. 1985. A projected Lagrangian algorithm for semi-infinite programming. Math. Prog. 32, 3, 337-356.
7. FANG, S.-C. AND WU, S.-Y. 1994. An inexact approach to solving linear semi-infinite programming problems. Optimization 28, 291-299.
8. FERRIS, M. AND PHILPOTT, A. 1989. An interior point algorithm for semi-infinite linear programming. Math. Prog. 43, 257-276.
9. FOURER, R., GAY, D., AND KERNIGHAN, B. 1990. A modeling language for mathematical programming. Manage. Sci. 36, 5, 519-554. http://www.ampl.com.
10. GAY, D. 1993. Hooking your solver to AMPL. Numerical Analysis Manuscript 93-10, AT&T Bell Laboratories, ftp://netlib.bell-labs.com/netlib/att/cs/doc/ 93/4-10.ps.Z.
11. GOCKENBACH, M. AND KEARSLEY, A. 1999. Optimal signal sets for non-gaussian detectors. SIAM J. Optim. 9, 2, 316-326.
12. GONZAGA, C., POLAK, E., AND TRAHAN, R. 1980. An improved algorithm for optimization problems with functional inequality constraints. IEEE Trans. Autom. Contr. AC-25, 1 (February), 49-54.
13. GÖRNER, S. 1997. Ein hybridverfahren zur lösung nichtlinearer semi-infiniter optimierungsprobleme. Ph.D. thesis, Fachbereich Mathematik der Technischen Universität Berlin.
14. GUGAT, M. 1994. Fractional semi-infinite programming. Ph.D. thesis, Trier University, Germany.
15. HAAREN-RETAGNE, E. 1992. A semi-infinite programming algorithm for robot trajectory planning. Ph.D. thesis, University of Trier.
16. HETTICH, R. 1979. A comparison of some numerical methods for semi-infinite programming. In Semi-Infinite Programming, R. Hettich, Ed. Springer-Verlag., 112-125.
17. HETTICH, R. 1986. An implementation of a discretization method for semi-infinite programming. Math. Prog. 34, 3, 354-361.
18. HETTICH, R. AND GRAMLICH, G. 1990. A note on an implementation of a method for quadratic semi-infinite programming. Math. Prog. 46, 249-254.
19. JENNINGS, L. AND TEO, K. 1990. A computational algorithm for functional inequality constrained optimization problems. Automatica 26, 2, 371-375.
20. KERNIGHAN, B. AND RICHIE, D. 1988. The C Programming Language. Prentice Hall.
21. KORTANEK, K. AND No, H. 1993. A central cutting plane algorithm for convex semi-infinite programming problems. SIAM J. Optim. 3, 4, 901-918.
22. LAWRENCE, C. AND TITS, A. 1998. Feasible sequential quadratic programming for finely discretized problems from SIP. In Semi-Infinite Programming, R. Reemsten and J.-J. Rückmann, Eds. Kluwer Academc Publisshers, 159-193.
23. LEÓN, T., SANMATÍAS, S., AND VERCHER, E. 1998. A multi-local optimization algorithm. Top 6, 1, 1-18.
24. LEÓN, T., SANMATÍAS, S., AND VERCHER, E. 2000. On the numerical treatment of linearly constrained semi-infinite optimization problems. Europ. J. Operational Research 121, 78-91.
25. LI, Y. AND WANG, D. 1997. A semi-infinite programming model for Earliness/Tardiness production planning with simulated annealing. Math. Comput. Modelling 26, 7, 35-42.
26. LIN, C.-J., FANG, S.-C., AND WU, S.-Y. 1998. An unconstrained convex programming approach to linear semi-infinite programming. SIAM J. Optim. 8, 2, 443-456.
27. LIU, Y., TEO, K., AND ITO, S. 1999. A dual parametrization approach to linear-quadratic semi-infinite programming problems. Optim. Methods Soft. 10, 471-495.
28. MARIN, S. 1988. Optimal parametrization of curves for robot trajectory design. IEEE Trans. Auto. Contr. 33, 2, 209-214.
29. MATHWORKS. 1996. Application Program Interface Guide. The MathWorks Inc.
30. MATHWORKS. 1999. MATLAB. The MathWorks Inc. Version 5.4, Release 11.
31. PANIER, E. AND TITS, A. 1989. A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design. IEEE Trans. Auto. Contr. 34, 8, 903-908.
32. POLAK, E., QI, L., AND SUN, D. 1999. First-order algorithms for generalized semi-infinite min-max problems. Computational Optimization and Applications 13,137-161.
33. POTCHINKOV, A. 1997. Design of optimal linear phase FIR filters by a semi-infinite programming technique. Signal Processing 58, 165-180.
34. PRICE, C. 1992. Non-linear semi-infinite programming. Ph.D. thesis, University of Canterbury, New Zealand.
35. PRICE, C. AND COOPE, I. 1996. Numerical experiments in semi-infinite programming. Computational Optimization and Applications 6, 169-189.
36. REEMTSEN, R. 1991. Discretization methods for the solution of semi-infinite programming problems. J. Optim. Theory Applic. 71, 1, 85-103.
37. STILL, G. 2001. Discretization in semi-infinite programming: The rate of convergence. Math. Prog. 91, 53-69.
38. TANAKA, Y. 1999. A trust region method for semi-infinite programming problems. Int. J. Syst. Sci. 30, 2, 199-204.
39. TEO, K. AND GOH, C. 1987. A simple computational procedure for optimization problems with functional inequality constraints. IEEE Trans. Auto. Contr. AC-32, 10 (October), 940-941.
40. TEO, K., REHBOCK, V., AND JENNINGS, L. 1993. A new computational algorithm for functional inequality constrained optimization problems. Automatica 29, 3, 789-792.
41. TODD, M. 1994. Interior-point algorithms for semi-infinite programming. Math. Prog. 65, 217-245.
42. VAZ, A., FERNANDES, E., AND GOMES, M. 2002. NSIPS v2.1: Nonlinear Semi-Infinite Programming Solver. Tech. Rep. ALG/EF/5-2002, Universidade do Minho, Braga, Portugal. December. http://www.norg.uminho.pt/aivaz/.
43. WANG, D. AND FANG, S.-C. 1996. A semi-infinite programming model for Earliness/Tardiness production planning with a genetic algorithm. Computers and Mathematics with Applications 31, 8, 95-106.
44. WATSON, G. 1983. Numerical experiments with globally convergent methods for semi-infinite programming problems. In Semi-Infinite Programming and Applications, A. Fiacco and K. Kortanek, Eds. Springer-Verlag, 193-205.
45. ZHOU, J. AND TITS, A. 1996. An SQP algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions. SIAM J. Optim. 6, 2, 461-487.