A new dual problem for nondifferentiable convex programming (Q811398): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02015344 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2055885935 / rank | |||
Normal rank |
Latest revision as of 12:14, 30 July 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