Convergence and approximation for primal-dual methods in large-scale optimization

ResearchWorks/Manakin Repository

Search ResearchWorks


Advanced Search

Browse

My Account

Statistics

Related Information

Convergence and approximation for primal-dual methods in large-scale optimization

Show full item record

Title: Convergence and approximation for primal-dual methods in large-scale optimization
Author: Wright, Stephen E., 1962-
Abstract: Large-scale problems in convex optimization often can be reformulated in primal-dual (minimax) representations having special decomposition properties. Approximation of the resulting high-dimensional problems by restriction to low-dimensional subspaces leads to a family of minimax problems dependent on a parameter. The continuity and convergence properties of this dependence are explored in this dissertation. Examples in optimal control and stochastic programming are considered in which discretizations give rise to large-scale optimization problems. A possible approach to the numerical solution of the discretized problems is described, as well as details of its computer implementation.
Description: Thesis (Ph. D.)--University of Washington, 1990
URI: http://hdl.handle.net/1773/5751

Files in this item

Files Size Format View
9117998.pdf 3.413Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record