On Convergence Of The Maximum Block Improvement Method
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
With the ever-growing data sizes along with the increasing complexity of the modern problem formulations, contemporary applications in science and engineering impose heavy computational and storage burdens on the optimization algorithms. As a result, there ...
Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...
Consider the problem of minimizing a convex differentiable function on the probability simplex, spectrahedron, or set of quantum density matrices. We prove that the expo-nentiated gradient method with Armijo line search always converges to the optimum, if ...
Two popular examples of first-order optimization methods over linear spaces are coordinate descent and matching pursuit algorithms, with their randomized variants. While the former targets the optimization by moving along coordinates, the latter considers ...
A Quasi Toeplitz (QT) matrix is a semi-infinite matrix of the kind A=T(a)+E whereT(a)=(aj−i)i,j∈Z+, E=(ei,j)i,j∈Z+ is compact and the norms ∥a∥W=∑i∈Z∣a∣j and $|E|_{ ...
We consider a family of multivariate trace inequalities recently derived by Sutter, Berta, and Tomamichel. These inequalities generalize the Golden-Thompson inequality and Lieb’s triple matrix inequality to an arbitrary number of matrices in a way that fea ...
We revisit the problem of constraining the weak field limit of the gravitational lagrangian from S-matrix properties. From unitarity and Lorentz invariance of the S-matrix of massless gravitons, we derive on-shell gauge invariance to consist on the transve ...
The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while Covariance Matrix Adapta- tion Evolution Strategy is one of the most efficient algorithms for unconstrai ...
Institute of Electrical and Electronics Engineers2016
The flexibility of distributed energy resources (DERs) accommodated in active distribution networks (ADNs) can be aggregated and then used to provide ancillary services to the transmission system. In this context, this paper presents a linear optimization ...
Several useful variance-reduced stochastic gradient algorithms, such as SVRG, SAGA, Finito, and SAG, have been proposed to minimize empirical risks with linear convergence properties to the exact minimizers. The existing convergence results assume uniform ...
