Lagrange-type duality in DC programming problems with equivalent DC inequalities (Q340375): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59471566, #quickstatements; #temporary_batch_1710979808849 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Duality in D. C. programming: The case of several D. C. constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lagrange-type duality in DC programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4273942 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On general minimax theorems / rank | |||
Normal rank |
Latest revision as of 23:18, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lagrange-type duality in DC programming problems with equivalent DC inequalities |
scientific article |
Statements
Lagrange-type duality in DC programming problems with equivalent DC inequalities (English)
0 references
14 November 2016
0 references
DC function
0 references
DC programming problem
0 references
Lagrange duality theorem
0 references
constraint qualification
0 references
0 references
0 references