Solving cone-constrained convex programs by differential inclusions

Solving cone-constrained convex programs by differential inclusions

0.00 Avg rating0 Votes
Article ID: iaor19961360
Country: Netherlands
Volume: 65
Issue: 1
Start Page Number: 107
End Page Number: 121
Publication Date: May 1994
Journal: Mathematical Programming (Series A)
Authors: ,
Abstract:

A differential inclusion is designed for solving cone-constrained convex programs. The method is of subgradient-projection type. It involves projection, penalties and Lagrangian relaxation. Non-smooth data can be accommodated. A novelty is that multipliers converge monotonically upwards to equilibrium levels. An application to stochastic programming is considered.

Reviews

Required fields are marked *. Your email address will not be published.