Nondifferentiable mathematical programming and convex-concave functions
From MaRDI portal
Cites work
- A class of nondifferentiable mathematical programming problems
- A Solvability Theorem for Homogeneous Functions
- A subgradient duality theorem
- scientific article; zbMATH DE number 3296906 (Why is no real title available?)
- Necessary conditions and sufficient conditions for static minmax problems
- Sufficient conditions for extremum, penalty functions and regularity
Cited in
(11)- A class of nonlinear complementarity problems for multifunctions
- Minimax programming under (p,r)-invexity
- Minimax programming as a tool for studying robust multi-objective optimization problems
- On second-order duality for nondifferentiable minimax fractional programming
- Nondifferentiable minimax programming problems with applications
- Minimax programming under generalized (p, r)-invexity
- On second-order duality for a class of nondifferentiable minimax fractional programming problem with \((C,\alpha,\rho,d)\)-convexity
- Nonsmooth minimax programming problems with \(V\)-\(r\)-invex functions
- Optimality conditions for a class of nondifferentiable minmax programming problems
- Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
This page was built for publication: Nondifferentiable mathematical programming and convex-concave functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1131954)