Nondifferentiable programming and duality with modified convexity

DOI10.1017/S0004972700013265MaRDI QIDQ3741430zbMATH OpenOpenAlexFDO

Authors V. 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 derivativesnon-Lipschitz functionsp-convexity

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(2)

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

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

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