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

DOI10.1080/02331939808844402zbMATH Open0916.90244OpenAlexW2050314135MaRDI QIDQ4227983FDOQ4227983

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

Recommendations

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

zbMATH Keywords

nonlinear programmingKarush-Kuhn-Tucker conditionsgeneralized gradientpseudoconvexquasiconvexfirst-order optimality conditionssingular 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)

Cites Work

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

Cited In (3)

• A sufficient optimality theoriem for protoconvex programs
• Protoconvex functions
• On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz 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)