IIASA RepositoryDecomposition via Alternating LinearizationK.KiwielauthorC.H.RosaauthorA.RuszczynskiauthorA new approximate proximal point method for minimizing the sum of two convex functions is introduced. It replaces the original problem by a sequence of regularized subproblems in which the functions are alternately represented by linear models. The method updates the linear models and the prox center, as well as the prox coefficient. It is monotone in terms of the objective values and converges to a solution of the problem, if any. A dual version of the method is derived and analyzed. Applications of the methods to multistage stochastic programming problems are discussed and preliminary numerical experience presented.1995-06WP-95-051Monograph

For work being deposited by its own author: In self-archiving this collection of files and associated bibliographic metadata, I grant IIASA Repository the right to store them and to make them permanently available publicly for free on-line. I declare that this material is my own intellectual property and I understand that IIASA Repository does not assume any responsibility if there is any breach of copyright in distributing these files or metadata. (All authors are urged to prominently assert their copyright on the title page of their work.)

For work being deposited by someone other than its author: I hereby declare that the collection of files and associated bibliographic metadata that I am archiving at IIASA Repository) is in the public domain. If this is not the case, I accept full responsibility for any breach of copyright that distributing these files or metadata may entail.

Clicking on the deposit button indicates your agreement to these terms.