Abstract
Using a minmax approach, we establish saddle point optimality conditions and Lagrangian duality relations under generalized convexity hypotheses for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints. We also discuss the implications of these results for differentiable problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Journal of Mathematical Analysis and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
