A relaxed cutting method for the convex programming problem (Q6945729)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8077294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A relaxed cutting method for the convex programming problem |
scientific article; zbMATH DE number 8077294 |
Statements
A relaxed cutting method for the convex programming problem (English)
0 references
8 August 2025
0 references
convex programming
0 references
constrained minimization
0 references
iteration point
0 references
approximating set
0 references
cutting plane
0 references
epigraph of a function
0 references
convergence
0 references
e-solution
0 references
0 references
0 references
