Abstract
An algorithm is presented which minimizes continuously differentiable pseudoconvex functions on convex compact sets which are characterized by their support functions. If the function can be minimized exactly on affine sets in a finite number of operations and the constraint set is a polytope, the algorithm has finite convergence. Numerical results are reported which illustrate the performance of the algorithm when applied to a specific search direction problem. The algorithm differs from existing algorithms in that it has proven convergence when applied to any convex compact set, and not just polytopal sets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barr, R. O.,An Efficient Computational Procedure for a Generalized Quadratic Programming Problem, SIAM Journal on Control, Vol. 7, pp. 415–429, 1969.
Frank, M., andWolfe, P.,An Algorithm for Quadratic Programming, Naval Research Logistics Quarterly, Vol. 3, pp. 95–110, 1956.
Gilbert, E. G.,An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set, SIAM Journal on Control, Vol. 4, pp. 61–80, 1966.
Wolfe, P.,Finding the Nearest Point in a Polytope, Mathematical Programming, Vol. 11, pp. 128–149, 1976.
Von Hohenbalken, B.,A Finite Algorithm to Maximize Certain Pseudoconcave Functions on Polytopes, Mathematical Programming, Vol. 9, pp. 189–206, 1975.
Pironneau, O., andPolak, E.,On the Rate of Convergence of Certain Methods of Centers, Mathematical Programming Vol. 2, pp. 230–258, 1972.
Polak, E.,On the Mathematical Foundations of Nondifferentiable Optimization in Engineering Design, SIAM Review, Vol. 29, pp. 21–89, 1987.
Polak, E., andSalcudean, S. E.,On the Design of Linear Multivariable Feedback Systems via Constrained Nondifferentiable Optimization in H∞ Spaces, IEEE Transactions on Automatic Control (to appear).
Canon, M. D., andCullum, C. D.,A Tight Upper Bound on the Rate of Convergence of the Frank-Wolfe Algorithm, SIAM Journal on Control, Vol. 6, 1968.
Hauser, J. E.,Proximity Algorithms: Theory and Implementation, Memorandum No. UCB/ERL M86/53, Electronics Research Laboratory University of California, Berkeley, California, 1986.
Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill, New York, New York, 1969.
Zangwill, W. I.,Nonlinear Programming: A Unified Approach, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.
Polak, E.,Computational Methods in Optimization, Academic Press, New York, New York, 1971.
Golub, G. H., andVan Loan, C. F.,Matrix Computations, Johns Hopkins University Press, Baltimore, Maryland, 1983.
Gill, P. E., Hammarling, S. J., Murray, W., Saunders, M. A., andWricht, M. H.,User's Guide for LSSOL (Version 1.0): A Fortran Package for Constrained Linear Least-Squares and Convex Quadratic Programming, Technical Report No. SOL 86-1, Department of Operations Research, Stanford University, Stanford, California, 1986.
Author information
Authors and Affiliations
Additional information
This research was supported by the National Science Foundation Grant ECS-85-17362, the Air Force Office Scientific Research Grant 86-0116, the Office of Naval Research Contract N00014-86-K-0295, the California State MICRO program, and the Semiconductor Research Corporation Contract SRC-82-11-008.
Rights and permissions
About this article
Cite this article
Higgins, J.E., Polak, E. Minimizing pseudoconvex functions on convex compact sets. J Optim Theory Appl 65, 1–27 (1990). https://doi.org/10.1007/BF00941156
Issue Date:
DOI: https://doi.org/10.1007/BF00941156