Linear-programming approach to nonconvex variational problems (Q706592): Difference between revisions
From MaRDI portal
Latest revision as of 16:54, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear-programming approach to nonconvex variational problems |
scientific article |
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