OSGA: a fast subgradient algorithm with optimal complexity
نویسندگان
چکیده
منابع مشابه
OSGA: a fast subgradient algorithm with optimal complexity
This paper presents an algorithm for approximately minimizing a convex function in simple, not necessarily bounded convex, finite-dimensional domains, assuming only that function values and subgradients are available. No global information about the objective function is needed apart from a strong convexity parameter (which can be put to zero if only convexity is known). The worst case number o...
متن کاملOptimal fast digital error correction method of pipelined analog to digital converter with DLMS algorithm
In this paper, convergence rate of digital error correction algorithm in correction of capacitor mismatch error and finite and nonlinear gain of Op-Amp has increased significantly by the use of DLMS, an evolutionary search algorithm. To this end, a 16-bit pipelined analog to digital converter was modeled. The obtained digital model is a FIR filter with 16 adjustable weights. To adjust weights o...
متن کاملSolving nonsmooth convex optimization with complexity O(ε)
This paper describes an algorithm for solving structured nonsmooth convex optimization problems using the optimal subgradient algorithm (OSGA), which is a first-order method with the complexity O(ε) for Lipschitz continuous nonsmooth problems and O(ε) for smooth problems with Lipschitz continuous gradient. If the nonsmoothness of the problem is manifested in a structured way, we reformulate the...
متن کاملAn Optimal Subgradient Algorithm for Large-scale Convex Optimization in Simple Domains
This paper shows that the optimal subgradient algorithm, OSGA, proposed in [59] can be used for solving structured large-scale convex constrained optimization problems. Only firstorder information is required, and the optimal complexity bounds for both smooth and nonsmooth problems are attained. More specifically, we consider two classes of problems: (i) a convex objective with a simple closed ...
متن کاملA Fast and Optimal Hand Isomorphism Algorithm
In a section of their 2007 paper, Gilpin, Sandholm, and Sørensen outline a technique for indexing poker hands that accounts for suit isomorphisms. Their implementation is specific to Texas Hold’em as it requires a large case analysis, and is not optimal as many cases are omitted. In this paper, we build on their ideas and provide a fast and optimal technique that generalizes beyond Texas Hold’e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2015
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-015-0911-4