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

DOI10.1080/00207177308932560zbMATH Open0271.90040OpenAlexW1986257383MaRDI QIDQ3214722FDOQ3214722

Authors: 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)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Sufficient optimality conditions in continuous-time nonlinear programming
• Sufficient conditions for optimal controls—use of generalized convexity†
• Generalization of some duality theorems in nonlinear programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3214722)