Accelerated proximal envelopes: application to componentwise methods

DOI10.1134/S0965542522020038zbMath1487.90602OpenAlexW4220697903MaRDI QIDQ2116598

V. V. Matyukhin, D. A. Pasechnyuk, Anton S. Anikin

Publication date: 18 March 2022

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542522020038

zbMATH Keywords

catalystaccelerated componentwise methodaccelerated proximal methodLogSumExpSoftMax

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Uses Software

• SciPy
• logsumexp-softmax-tests

Cites Work

• Unnamed Item
• Efficient numerical methods for entropy-linear programming problems
• Lectures on convex optimization
• Accelerated meta-algorithm for convex optimization problems
• An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems
• Monotone Operators and the Proximal Point Algorithm
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice
• Contracting Proximal Methods for Smooth Convex Optimization

This page was built for publication: Accelerated proximal envelopes: application to componentwise methods