Optimality conditions for non-lipschitz generalized convex programming via clarke-rockafellar gradients

DOI10.1080/02331939808844402MaRDI QIDQ4227983zbMATH OpenOpenAlexFDO

Authors Thurai Kugendran, L. McLinden

Publication date 27 July 1999

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic gradientfirst-order optimality conditionsgeneralized gradientKarush-Kuhn-Tucker conditionsnonlinear programmingprotoconvexpseudoconvexquasiconvexsingular gradient

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Nonsmooth analysis (49J52) Optimality conditions (49K99) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 1159218
• scientific article; zbMATH DE number 1805987
• Second-Order Sufficiency Conditions for Nondifferentiable Programming Problems
• Generalized Nonsmooth Invexity

Cites work

• Clarke's tangent cones and the boundaries of closed sets in Rn
• Convex Analysis
• Directionally Lipschitzian Functions and Subdifferential Calculus
• Extensions of subgradient calculus with applications to optimization
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• scientific article; zbMATH DE number 3858867 (Why is no real title available?)
• scientific article; zbMATH DE number 592637 (Why is no real title available?)
• Mathematical programming problems with quasi-convex objective functions
• On sufficient optimality conditions for a quasiconvex programming problem
• Optimization and nonsmooth analysis
• Protoconvex functions
• Pseudo-Concave Programming and Lagrange Regularity
• Quasi-Concave Programming
• Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming
• Sufficient conditions for extremum, penalty functions and regularity
• Weak lower subdifferentials and applications

Cited in

(3)

• On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions
• A sufficient optimality theoriem for protoconvex programs
• Protoconvex functions

This page was built for publication: Optimality conditions for non-lipschitz generalized convex programming via clarke-rockafellar gradients

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