Stochastic Methods For Large Scale Linear Problems Variational Inequalities And Convex Optimization

Download Stochastic Methods For Large Scale Linear Problems Variational Inequalities And Convex Optimization PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Stochastic Methods For Large Scale Linear Problems Variational Inequalities And Convex Optimization book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Stochastic Methods for Large-scale Linear Problems, Variational Inequalities, and Convex Optimization

This thesis considers stochastic methods for large-scale linear systems, variational inequalities, and convex optimization problems. I focus on special structures that lend themselves to sampling, such as when the linear/nonlinear mapping or the objective function is an expected value or is the sum of a large number of terms, and/or the constraint is the intersection of a large number of simpler sets. For linear systems, I propose modifications to deterministic methods to allow the use of random samples and maintain the stochastic convergence, which is particularly challenging when the unknown system is singular or nearly singular. For variational inequalities and optimization problems, I propose a class of methods that combine elements of incremental constraint projection, stochastic gradient/ subgradient descent, and proximal algorithm. These methods can be applied with various sampling schemes that are suitable for applications involving distributed implementation, large data set, or online learning. I use a unified framework to analyze the convergence and the rate of convergence of these methods. This framework is based on a pair of supermartingale bounds, which control the convergence to feasibility and the convergence to optimality, respectively, and are coupled at different time scales.
Convex Optimization

Author: Stephen P. Boyd
language: en
Publisher: Cambridge University Press
Release Date: 2004-03-08
Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.
Large-Scale Convex Optimization

Author: Ernest K. Ryu
language: en
Publisher: Cambridge University Press
Release Date: 2022-12
A unified analysis of first-order optimization methods, including parallel-distributed algorithms, using monotone operators.