Convex Optimization in Signal Processing and Communications

DOI10.1017/CBO9780511804458zbMath1200.90009OpenAlexW562372631MaRDI QIDQ4931751

No author found.

Publication date: 30 September 2010

Full work available at URL: https://doi.org/10.1017/cbo9780511804458

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx) Communication, information (94Axx)

Related Items (25)

On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems ⋮ A new hybrid regularization scheme for removing salt and pepper noise ⋮ A simplified view of first order methods for optimization ⋮ A new class of hybrid extragradient algorithms for solving quasi-equilibrium problems ⋮ Improved design of unimodular waveforms for MIMO radar ⋮ First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems ⋮ Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method ⋮ 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 ⋮ Proximal alternating linearized minimization for nonconvex and nonsmooth problems ⋮ Min-max optimization over slowly time-varying graphs ⋮ Distributed robust adaptive equilibrium computation for generalized convex games ⋮ Sharper Bounds for Proximal Gradient Algorithms with Errors ⋮ On convergence rates of game theoretic reinforcement learning algorithms ⋮ On Distributed Generalized Nash Equilibrium Seeking ⋮ Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming ⋮ Radio-frequency chain selection for energy and spectral efficiency maximization in hybrid beamforming under hardware imperfections ⋮ Performance of first-order methods for smooth convex minimization: a novel approach ⋮ 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 conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ SPARCOM: Sparsity Based Super-resolution Correlation Microscopy ⋮ On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints ⋮ Bilevel Methods for Image Reconstruction

This page was built for publication: Convex Optimization in Signal Processing and Communications