Nondifferentiable programming and duality with modified convexity

DOI10.1017/S0004972700013265zbMath0604.90112OpenAlexW2077158299MaRDI QIDQ3741430

Vaithilingam Jeyakumar

Publication date: 1987

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700013265

zbMATH Keywords

directional derivativesp-convexitynon-Lipschitz functions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)

Related Items (2)

On Quasidifferentiable Functions and Non-Differentiable Programming ⋮ What is quasiconvex analysis?

Cites Work

• A generalization of a minimax theorem of Fan via a theorem of the alternative
• Strong and Weak Convexity of Sets and Functions
• Convexlike alternative theorems and mathematical programming
• Nonlinear alternative theorems and nondifferentiable programming

This page was built for publication: Nondifferentiable programming and duality with modified convexity