First-order methods for nonnegative trigonometric matrix polynomials

DOI10.1007/S10957-024-02581-5MaRDI QIDQ7031923zbMATH OpenFDO

Authors Daniel Cederberg

Publication date 6 February 2025

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-024-02581-5

zbMATH Keywords

first-order methodsDouglas-Rachford splittinggeneralized distancesBregman proximal operator

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Semidefinite programming (90C22) Set-valued and variational analysis (49J53) Optimality conditions (49K99)

Cites work

• scientific article; zbMATH DE number 1489808 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 1445419 (Why is no real title available?)
• A first-order primal-dual algorithm for convex problems with applications to imaging
• AR Identification of Latent-Variable Graphical Models
• Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems
• Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
• Block- and Rank-Sparse Recovery for Direction Finding in Partly Calibrated Arrays
• Bregman primal-dual first-order method and application to sparse semidefinite programming
• Bregman three-operator splitting methods
• Conic optimization via operator splitting and homogeneous self-dual embedding
• Convex optimization problems involving finite autocorrelation sequences
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Entropic Proximal Operators for Nonnegative Trigonometric Polynomials
• First-order methods in optimization
• Graphical models of autoregressive processes
• High performance algorithms for Toeplitz and block Toeplitz matrices
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
• Linear Stochastic Systems
• MA estimation in polynomial time.
• Matrix-valued nevanlinna-pick interpolation with complexity constraint: an optimization approach
• Nonlinear programming
• On the ergodic convergence rates of a first-order primal-dual algorithm
• On the parameterization of positive real sequences and MA parameter estimation
• Optimization Problems over Positive Pseudopolynomial Matrices
• Orthogonal polynomial matrices on the unit circle
• Solving semidefinite-quadratic-linear programs using SDPT3
• Spectral factorizations and sums of squares representations via semidefinite programming
• Time and Spectral Domain Relative Entropy: A New Approach to Multivariate Spectral Estimation
• Time series. Data analysis and theory.
• Topology selection in graphical models of autoregressive processes

This page was built for publication: First-order methods for nonnegative trigonometric matrix polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031923)