Alternating minimization methods for strongly convex optimization

DOI10.1515/jiip-2020-0074zbMath1478.90092arXiv1911.08987OpenAlexW3155282024MaRDI QIDQ2232092

Nazarii Tupitsa, Sergey Guminov, Alexander V. Gasnikov, Pavel Dvurechensky

Publication date: 4 October 2021

Published in: Journal of Inverse and Ill-Posed Problems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.08987

zbMATH Keywords

convex optimizationnonconvex optimizationcomplexity analysisalternating minimizationblock-coordinate method

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Stochastic approximation versus sample average approximation for Wasserstein barycenters ⋮ Stochastic saddle-point optimization for the Wasserstein barycenter problem ⋮ Recent theoretical advances in decentralized distributed convex optimization ⋮ Recent Theoretical Advances in Non-Convex Optimization

Cites Work

• Tensor Decompositions and Applications
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Iteration complexity analysis of block coordinate descent methods
• Lectures on convex optimization
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
• Accelerated alternating descent methods for Dykstra-like problems
• Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
• An adaptive proximal method for variational inequalities
• Mirror descent and convex optimization problems with non-smooth inequality constraints
• Cubic regularization of Newton method and its global performance
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Numerical methods for the resource allocation problem in a computer network
• A stable alternative to Sinkhorn's algorithm for regularized optimal transport
• Optimal combination of tensor optimization methods
• A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
• A literature survey of low-rank tensor approximation techniques
• On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
• Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
• Computational Methods for Inverse Problems
• Iterative Solution of Nonlinear Equations in Several Variables
• Composite optimization for the resource allocation problem
• Primal–dual accelerated gradient methods with small-dimensional relaxation oracle
• A Statistical Model for Positron Emission Tomography
• Iterative Bregman Projections for Regularized Transportation Problems
• Nonnegative Tensor Decomposition
• On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
• An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternating minimization methods for strongly convex optimization