The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†
- 1 July 1973
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 18 (4) , 831-838
- https://doi.org/10.1080/00207177308932560
Abstract
Several sufficient conditions for global constrained minima are given. These conditions consist of necessary conditions for local minima together with generalized convexity assumptions. The eonvexity-type assumptions are made on the Lagrangian function, which presents the advantage of not requiring any (generalized convexity) assumption on each function involved in the problem and of allowing problems with several local extrema. Previously obtained results are used to replace pseudo-convexity by a more workable condition.Keywords
This publication has 7 references indexed in Scilit:
- Nonlinear programming: Global use of the LagrangianJournal of Optimization Theory and Applications, 1970
- Quasi-Convex ProgrammingSIAM Journal on Applied Mathematics, 1968
- Second Order Conditions for Constrained MinimaSIAM Journal on Applied Mathematics, 1967
- Seven Kinds of ConvexitySIAM Review, 1967
- Constrained Minimization Problems in Finite-Dimensional SpacesSIAM Journal on Control, 1966
- Quasi-Concave ProgrammingEconometrica, 1961
- Nonlinear ProgrammingPublished by University of California Press ,1951