在此篇論文中，我們考慮非線性半無限規劃且其限制式為線性函數的問題，藉由解一序列的二次半無限規劃(SQP)去解出此問題。在論文中，展示我們的演算法及此問題的K-K-T系統，並且給出我們演算法的收斂性證明。最後，我們比較我們的演算法和在MATLAB中解半無限規劃的SQP方法，可以發現我們的方法比MATLAB中的方法快。

We consider the nonlinear semi-infinite program-ming problems (SIP) with linear constraints. We solve this problem via solving sequential quadr-atic semi-infinite programming. We present the connection between our algorithm and K-K-T sys-tem of (SIP), and give the convergence proof of our algorithm to the local optimal solution of the (SIP). Finally, the numerical results show that this method does better the computation ti-me than the (SQP) methods for (SIP) in MATLAB.

[1] M. Bazaraa, H. Sherali, C. Shetty, Nonlinear programming: Theory and Algorithms, John Wiley, NY, c1993
[2] S. C. Fang, C. J. Lin and S. Y. Wu, Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme, J. Comput. Appl. Math., Vol.129, pp.89-104, 2001.
[3] S. C. Fang and S. Puthenpura, Linear optimization and extensions: Theory and Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1993.
[4] G. Gramlich, R. Hettich and E. W. Sachs, Local convergence of SQP method in semiinfinite programming, SIAM J. Optim., Vol.5, pp.641-658, 1995.
[5] R. Hettich and K. Kortanek, Semi-infinite programming: theory, methods and applications, SIAM Review, Vol.35, pp.380-429, 1993.
[6] J. Nocedal and S. J. Wright, Numerical optimization, Springer, New York, 1999.
[7] E. Polak, Optimization: Algorithms and consistent approximation, Springer-Verlag, NY, 1997.
[8] E. Polak, A. L. Tits, A recursive quadratic programming algorithm for semi-infinite optimization problems, Appl. Math. Optim., Vol.8, pp.325-349, 1982.
[9] J. J. R¨uckmann, On existence and uniqueness of stationary points in semi-infinite optimization, Math. Program., Ser. A, Vol.86, pp.387-415, 1999.
[10] G.Still, Solving generalized semi-infinite programs by reduction to simpler problems, Optimization, Vol.53, pp.19-38, 2004.
[11] Y. Tanaka, M. Fukushima and T. Hasegawa Implementable L1 penalty-function
method for semi-infinite optimization, Int. J. Systems SCI., Vol.18, pp.1563-1568, 1987.
[12] G. A. Watson, Globally convergent methods for semi-infinite programming, BIT, Vol.21, pp.362-373, 1981.
[13] S. Y. Wu, D. H. Li, L. Qi and G. Zhou, An iterative method for solving KKT system of the semi-infinite programming, summitted.
[14] S. Y. Wu and S. C. Fang, Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method, Comput. Math. Appl., Vol.38, pp.23-33, 1999.
[15] S. Y. Wu, S. C. Fang and C. J. Lin, Relaxed cutting plane for solving linear semiinfinite programming problems, J. Optim. Theory Appl., Vol.99, pp.759-779, 1998.
[16] The Math Works Inc., Matlab User Guide, The MathWorks, Natick, MA, 01760-1500, 1996