Abstract
In this paper, we complete a cycle in the construction of methods of feasible directions for solving semi-infinite constrained optimization problems. Earlier phase I-phase II methods of feasible directions used one search direction rule in all of ℝn with two stepsize rules, one for feasible points and one for infeasible points. The algorithm presented in this paper uses both a single search direction rule and a single stepsize rule in all of ℝn. In addition, the new algorithm incorporates a steering parameter which can be used to control the speed with which feasibility is achieved. The new algorithm is simpler to analyze and performs somewhat better than existing, first order, phase I-phase II methods. The new algorithm is globally convergent, with linear rate.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Zoutendijk, G.,Methods of Feasible Directions, Elsevier, Amsterdam, Holland, 1960.
Zukhovitskii, S. I., Polyak, R. A., andPrimak, M. E.,An Algorithm for the Solution of Convex Programming Problems, Doklady Akademii Nauk SSSR, Vol. 153, pp. 991–1000, 1963.
Topkis, D. M., andVeinott, A. F. Jr.,On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming, SIAM Journal on Control, Vol. 5, pp. 268–279, 1967.
Polak, E.,Computational Methods in Optimization: A Unified Approach, Academic Press, New York, New York, 1971.
Polak, E., Trahan, R., andMayne, D. Q.,Combined Phase I-Phase II Methods of Feasible Directions, Mathematical Programming, Vol. 17, pp. 61–73, 1979.
Polak, E.,On the Mathematical Foundations of Nondifferentiable Optimization in Engineering Design, SIAM Review, Vol. 29, No. 1, pp. 21–91, 1987.
Polak, E., andHe, L.,Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control, Memorandum No. UCB/ERL-M89/112, Electrical Research Laboratory, University of California, Berkeley, 1989.
Clarke, F. H.,Optimization and Nonsmooth Analysis, Wiley-Interscience, New York, New York, 1983.
Pironneau, O., andPolak, E.,On the Rate of Convergence of Certain Methods of Centers, Mathematical Programming, Vol. 2, pp. 230–258, 1972.
Klessig, R., andPolak, E.,An Adaptive Precision Gradient Method for Optimal Control, SIAM Journal on Control, Vol. 10, pp. 80–93, 1973 and Vol. 10, pp. 760–784, 1973.
He, L., andPolak, E.,Effective Diagonalization Strategy for the Solution of a Class of Optimal Design Problems, IEEE Transactions on Automatic Control, Vol. AC-35, No. 3, pp. 258–267, 1990.
Higgins, J. E., andPolak, E.,Minimizing Pseudo-Convex Functions on Convex Compact Sets, Journal of Optimization Theory and Applications, Vol. 65, No. 1, pp. 1–28, 1990.
Conn, A. R.,Constrained Optimization Using a Nondifferentiable Penalty Function, SIAM Journal on Numerical Analysis, Vol. 10, No. 4, pp. 760–784, 1973.
Assadi, J.,A Computational Comparison of Some Nonlinear Programs, Mathematical Programming, Vol. 4, pp. 144–154, 1973.
Tanaka, Y., Fukushima, M., andIbaraki, T.,A Comparative Study of Several Semi-Infinite Nonlinear Programming Algorithms, European Journal of Operational Research, Vol. 36, pp. 92–100, 1988.
Berge, C.,Topological Spaces, Macmillan, New York, New York, 1963.
Armijo, L.,Minimization of Functions Having Continuous Partial Derivatives, Pacific Journal of Mathematics, Vol. 16, pp. 1–3, 1966.
Author information
Authors and Affiliations
Additional information
The research reported herein was sponsored in part by the National Science Foundation Grant ECS-8713334, the Air Force Office of Scientific Research Contract AFOSR-86-0116, and the State of California MICRO Program Grant 532410-19900.
The authors would like to thank Dr. J. Higgins for providing the C-code of Algorithm 3.1.
Rights and permissions
About this article
Cite this article
Polak, E., He, L. Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization. J Optim Theory Appl 69, 83–107 (1991). https://doi.org/10.1007/BF00940462
Issue Date:
DOI: https://doi.org/10.1007/BF00940462