Nondifferentiable mathematical programming and convex-concave functions (Q1131954): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A class of nondifferentiable mathematical programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A subgradient duality theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Solvability Theorem for Homogeneous Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Necessary conditions and sufficient conditions for static minmax problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sufficient conditions for extremum, penalty functions and regularity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5580054 / rank | |||
Normal rank |
Latest revision as of 02:29, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nondifferentiable mathematical programming and convex-concave functions |
scientific article |
Statements
Nondifferentiable mathematical programming and convex-concave functions (English)
0 references
1980
0 references
necessary conditions of optimality
0 references
dual problem
0 references
duality theorem
0 references
converse duality theorem
0 references
minimax theorem
0 references
Kuhn-Tucker optimality conditions
0 references
constraint qualifications
0 references
nondifferentiable programming
0 references