Abstract
Necessary Lagrangian conditions are obtained for nonsmooth optimization problems, involving locally Lipschitz functions and arbitrary convex cones.The approach is by a sequence of smooth local approximations to the problem, which leads to Clarke generalized gradients in the limit.The method is applied to finite dimensional problems with convex cones, semiinfinite programming problems, continuous programming problems, and optimal control, giving Pontbyaoin type conditions.A duality theorem is also obtained, with the usual convexity hypotheses weakened to a generalized invex condition, using generalized gradients.
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 callDisclaimer: 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.
