Convex Optimization in Signal Processing and Communications
From MaRDI portal
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Communication, information (94Axx)
Cited in
(37)- A simplified view of first order methods for optimization
- On convergence rates of game theoretic reinforcement learning algorithms
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Design of optimal utility of wireless rechargeable sensor networks via joint spatiotemporal scheduling
- A new hybrid regularization scheme for removing salt and pepper noise
- Performance of first-order methods for smooth convex minimization: a novel approach
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
- A new class of hybrid extragradient algorithms for solving quasi-equilibrium problems
- Improved design of unimodular waveforms for MIMO radar
- Convex optimization approach to signals with fast varying instantaneous frequency
- A hierarchical algorithm for vehicle-to-grid integration under line capacity constraints
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Two steps at a time-taking GAN training in stride with Tseng's method
- On Distributed Generalized Nash Equilibrium Seeking
- Radio-frequency chain selection for energy and spectral efficiency maximization in hybrid beamforming under hardware imperfections
- SPARCOM: sparsity based super-resolution correlation microscopy
- scientific article; zbMATH DE number 5685414 (Why is no real title available?)
- Bilevel Methods for Image Reconstruction
- Min-max optimization over slowly time-varying graphs
- Sharper Bounds for Proximal Gradient Algorithms with Errors
- A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
- On Tracking Varying Bounds When Forecasting Bounded Time Series
- Nonsmooth projection-free optimization with functional constraints
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
- A multi-step inertial extragradient algorithm for nonsmooth and nonconvex composite optimization problems
- A decentralized optimal iterative learning control approach with efficient computation for collaborative tracking
- A learned proximal alternating minimization algorithm and its induced network for a class of two-block nonconvex and nonsmooth optimization
- An inertial Bregman proximal gradient algorithm for nonconvex composite optimization problems
- General inertial proximal gradient method with gradient extrapolation for nonconvex nonsmooth optimization problems
- On the o(1/k^2) convergence rate analysis for general inertial gradient type method
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- Distributed robust adaptive equilibrium computation for generalized convex games
This page was built for publication: Convex Optimization in Signal Processing and Communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931751)
