A dual regularized method for solving a class of convex minimization problems (Q5954719)
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 1701705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual regularized method for solving a class of convex minimization problems |
scientific article; zbMATH DE number 1701705 |
Statements
A dual regularized method for solving a class of convex minimization problems (English)
0 references
28 October 2002
0 references
The author considers a class of convex infinite-dimensional minimization problems with inequality constraints in which the sum of the objective function and the constraints is strictly uniformly convex. For such problems, when an approximation is used, a method is suggested that consists in finding Lagrange multipliers for a finite-dimensional problem that is dual for the initial regularized problem.
0 references
regularization methods
0 references
convex infinite dimensional minimization problems
0 references
approximate solution
0 references
convergence
0 references
Hilbert space
0 references
inequality constraints
0 references
0.8677935600280762
0 references
0.825475811958313
0 references
