A sufficient optimality theoriem for protoconvex programs

DOI10.1080/02331930108844544MaRDI QIDQ2743663zbMATH OpenOpenAlexFDO

Authors Thurai Kugan

Publication date 26 March 2003

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

first-order sufficient optimality theoremsprotoconvex functionsquasiconvex

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• Convex Analysis
• Directionally Lipschitzian Functions and Subdifferential Calculus
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• scientific article; zbMATH DE number 3848919 (Why is no real title available?)
• Optimality conditions for non-lipschitz generalized convex programming via clarke-rockafellar gradients
• Optimization and nonsmooth analysis
• Protoconvex functions
• Quasi-Concave Programming
• Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming
• Weak lower subdifferentials and applications

Cited in

(1)

• A SUFFICIENT CONDITION FOR OBTAINING SOLUTIONS OF A MAXIMIZING PROBLEM BY A PROJECTION

This page was built for publication: A sufficient optimality theoriem for protoconvex programs

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