Linear-programming approach to nonconvex variational problems (Q706592)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-programming approach to nonconvex variational problems |
scientific article; zbMATH DE number 2132459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-programming approach to nonconvex variational problems |
scientific article; zbMATH DE number 2132459 |
Statements
Linear-programming approach to nonconvex variational problems (English)
0 references
8 February 2005
0 references
The authors consider the sequential linear programming schemes for solving nonconvex variational problems. The convergence of the iterative method is studied by using the Banach fixed-point theorem. Several examples are given to illustrate the efficiency of the technique, which is another positive point of this paper.
0 references
linear programming
0 references
variational problems
0 references
iterative schemes
0 references
convergence
0 references
0 references
0 references
0 references
0 references
0 references
0.9338408
0 references
0.9334768
0 references
0.92956305
0 references
0.9264479
0 references
0.92340904
0 references
0.9201144
0 references
0.9169307
0 references
0.91549385
0 references
0.91526705
0 references
