Nondifferentiable mathematical programming and convex-concave functions

DOI10.1007/BF01262976zbMath0418.90073MaRDI QIDQ1131954

S. H. Smith

Publication date: 1980

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

dual problemminimax theoremduality theoremnecessary conditions of optimalityconstraint qualificationsnondifferentiable programmingKuhn-Tucker optimality conditionsconverse duality theorem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (11)

A class of nonlinear complementarity problems for multifunctions ⋮ Optimality conditions for a class of nondifferentiable minmax programming problems ⋮ Nondifferentiable minimax programming problems with applications ⋮ Minimax programming under generalized \((p, r)\)-invexity ⋮ Nonsmooth minimax programming problems withV−r-invex functions ⋮ On second-order duality for nondifferentiable minimax fractional programming ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ On second-order duality for a class of nondifferentiable minimax fractional programming problem with \((C,\alpha,\rho,d)\)-convexity ⋮ Minimax programming under \((p,r)\)-invexity ⋮ Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems ⋮ Minimax programming as a tool for studying robust multi-objective optimization problems

Cites Work

• Necessary conditions and sufficient conditions for static minmax problems
• A subgradient duality theorem
• A class of nondifferentiable mathematical programming problems
• A Solvability Theorem for Homogeneous Functions
• Sufficient conditions for extremum, penalty functions and regularity
• Unnamed Item

This page was built for publication: Nondifferentiable mathematical programming and convex-concave functions