The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A global method for some class of optimization and control problems.”

Solving convex program via Lagrangian decomposition

Matthias Knobloch (2004)

Kybernetika

Similarity:

We consider general convex large-scale optimization problems in finite dimensions. Under usual assumptions concerning the structure of the constraint functions, the considered problems are suitable for decomposition approaches. Lagrangian-dual problems are formulated and solved by applying a well-known cutting-plane method of level-type. The proposed method is capable to handle infinite function values. Therefore it is no longer necessary to demand the feasible set with respect to the...