On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces
Sign Up to like & getrecommendations! Published in 2022 at "Optimization Letters"
DOI: 10.1007/s11590-021-01753-w
Abstract: In this paper, the convergence of the fundamental alternating minimization is established for non-smooth non-strongly convex optimization problems in Banach spaces, and novel rates of convergence are provided. As objective function a composition of a… read more here.
Keywords: non smooth; convergence; non strongly; optimization ... See more keywords
A Fast Linearized Alternating Minimization Algorithm for Constrained High-Order Total Variation Regularized Compressive Sensing
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2944173
Abstract: In this paper, we propose a new high-order total variation regularized model with box constraint for image compressive sensing reconstruction. Because of the separable structure of this model, we can easily decompose into three subproblems… read more here.
Keywords: variation regularized; total variation; alternating minimization; compressive sensing ... See more keywords
Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2016.2561407
Abstract: In this technical note, the fast alternating minimization algorithm (FAMA) is proposed to solve model predictive control (MPC) problems with polytopic and second-order cone constraints. Two splitting strategies with efficient implementations for MPC problems are… read more here.
Keywords: mpc; alternating minimization; fast alternating; complexity ... See more keywords
Newton-Type Alternating Minimization Algorithm for Convex Optimization
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2018.2872203
Abstract: We propose a Newton-type alternating minimization algorithm (NAMA) for solving structured nonsmooth convex optimization problems where the sum of two functions is to be minimized, one being strongly convex and the other composed with a… read more here.
Keywords: alternating minimization; newton type; minimization algorithm;
Metalearning-Based Alternating Minimization Algorithm for Nonconvex Optimization.
Sign Up to like & getrecommendations! Published in 2022 at "IEEE transactions on neural networks and learning systems"
DOI: 10.1109/tnnls.2022.3165627
Abstract: In this article, we propose a novel solution for nonconvex problems of multiple variables, especially for those typically solved by an alternating minimization (AM) strategy that splits the original optimization problem into a set of… read more here.
Keywords: problem; based alternating; minimization; nonconvex optimization ... See more keywords