The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†

DOI10.1080/00207177308932560zbMath0271.90040OpenAlexW1986257383MaRDI QIDQ3214722

Pierre Mereau, J.-G. Paquet

Publication date: 1973

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207177308932560

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions (49K99)

Related Items (4)

Unnamed Item ⋮ Generalization of some duality theorems in nonlinear programming ⋮ Sufficient conditions for optimal controls—use of generalized convexity† ⋮ Sufficient optimality conditions in continuous-time nonlinear programming

Cites Work

• Nonlinear programming: Global use of the Lagrangian
• Quasi-Concave Programming
• Constrained Minimization Problems in Finite-Dimensional Spaces
• Seven Kinds of Convexity
• Second Order Conditions for Constrained Minima
• Quasi-Convex Programming

This page was built for publication: The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†