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

DOI10.1080/02331939808844402zbMath0916.90244OpenAlexW2050314135MaRDI QIDQ4227983

L. McLinden, Thurai Kugendran

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

nonlinear programmingKarush-Kuhn-Tucker conditionsfirst-order optimality conditionspseudoconvexgeneralized gradientquasiconvexsingular gradientasymptotic gradientprotoconvex

Mathematics Subject Classification ID

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

Related Items (2)

A sufficient optimality theoriem for protoconvex programs ⋮ Protoconvex functions

Cites Work

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

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