A new dual problem for nondifferentiable convex programming (Q811398): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4135211 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3968042 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3902815 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4194725 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3780031 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Regularity conditions for constrained extremum problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometry of optimality conditions and constraint qualifications: The convex case / rank | |||
Normal rank | |||
Latest revision as of 10:22, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new dual problem for nondifferentiable convex programming |
scientific article |
Statements
A new dual problem for nondifferentiable convex programming (English)
0 references
1990
0 references
nondifferentiable convex programming
0 references
weak duality
0 references
strong duality
0 references
