TFOCS

swMATH12839MaRDI QIDQ24763

No author found.

Described by source

• Templates for convex cone problems with applications to sparse signal recovery

Related Items (only showing first 100 items - show all)

Nonparametric operator-regularized covariance function estimation for functional data ⋮ Refined analysis of sparse MIMO radar ⋮ A secant-based Nesterov method for convex functions ⋮ An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems ⋮ A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization ⋮ Low-Rank and Sparse Dictionary Learning ⋮ The Moreau envelope based efficient first-order methods for sparse recovery ⋮ An inexact successive quadratic approximation method for L-1 regularized optimization ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems ⋮ OSGA: a fast subgradient algorithm with optimal complexity ⋮ A Newton Frank-Wolfe method for constrained self-concordant minimization ⋮ A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems ⋮ Book Review: A mathematical introduction to compressive sensing ⋮ Fast Phase Retrieval from Local Correlation Measurements ⋮ Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization ⋮ A Survey of Compressed Sensing ⋮ Generalized System Identification with Stable Spline Kernels ⋮ Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints ⋮ Phase retrieval for imaging problems ⋮ Tomographic image reconstruction using training images ⋮ Robust sparse phase retrieval made easy ⋮ Finding Dantzig selectors with a proximity operator based fixed-point algorithm ⋮ Sparse microwave imaging: principles and applications ⋮ Proximal Newton-Type Methods for Minimizing Composite Functions ⋮ A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms ⋮ Fast Methods for Denoising Matrix Completion Formulations, with Applications to Robust Seismic Data Interpolation ⋮ Multicompartment magnetic resonance fingerprinting ⋮ An alternating direction method for finding Dantzig selectors ⋮ A fast splitting method tailored for Dantzig selector ⋮ TILT: transform invariant low-rank textures ⋮ Adventures in Compressive Sensing Based MIMO Radar ⋮ The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector ⋮ A Direct Estimation Approach to Sparse Linear Discriminant Analysis ⋮ Iteratively reweighted \(\ell _1\) algorithms with extrapolation ⋮ A distributed algorithm for fitting generalized additive models ⋮ Optimal subgradient algorithms for large-scale convex optimization in simple domains ⋮ Matrix-Free Convex Optimization Modeling ⋮ Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems ⋮ A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems ⋮ SLOPE-adaptive variable selection via convex optimization ⋮ Accelerated linearized Bregman method ⋮ A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula ⋮ Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements ⋮ Super-resolution radar ⋮ Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery ⋮ Phase retrieval from low-rate samples ⋮ Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework ⋮ Implementation of an optimal first-order method for strongly convex total variation regularization ⋮ A relaxed-PPA contraction method for sparse signal recovery ⋮ Accelerated first-order methods for hyperbolic programming ⋮ Convergence of first-order methods via the convex conjugate ⋮ New preconditioners applied to linear programming and the compressive sensing problems ⋮ Proximal alternating penalty algorithms for nonsmooth constrained convex optimization ⋮ PRP-like algorithm for monotone operator equations ⋮ Optimization Methods for Large-Scale Machine Learning ⋮ A partially proximal linearized alternating minimization method for finding Dantzig selectors ⋮ A proximal difference-of-convex algorithm with extrapolation ⋮ An Accelerated Proximal Gradient Algorithm for Frame-Based Image Restoration via the Balanced Approach ⋮ Inexact proximal Newton methods for self-concordant functions ⋮ A significance test for the lasso ⋮ Discussion: ``A significance test for the lasso ⋮ Rejoinder: ``A significance test for the lasso ⋮ Robust subspace clustering ⋮ Pivotal estimation via square-root lasso in nonparametric regression ⋮ Adaptive smoothing algorithms for nonsmooth composite convex minimization ⋮ Learning with tensors: a framework based on convex optimization and spectral regularization ⋮ A global sparse gradient based coupled system for image denoising ⋮ On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems ⋮ A general self-adaptive relaxed-PPA method for convex programming with linear constraints ⋮ Robust budget allocation via continuous submodular functions ⋮ Acceleration of primal-dual methods by preconditioning and simple subproblem procedures ⋮ Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions ⋮ A dual reformulation and solution framework for regularized convex clustering problems ⋮ A tensor-based dictionary learning approach to tomographic image reconstruction ⋮ Super-Resolution of Positive Sources: The Discrete Setup ⋮ The matrix completion method for phase retrieval from fractional Fourier transform magnitudes ⋮ Using Nesterov's Method to Accelerate Multibody Dynamics with Friction and Contact ⋮ Robust finite mixture regression for heterogeneous targets ⋮ Phase recovery, MaxCut and complex semidefinite programming ⋮ Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization ⋮ Phase retrieval from coded diffraction patterns ⋮ Analysis of sparse MIMO radar ⋮ Low-Rank Spectral Optimization via Gauge Duality ⋮ Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval ⋮ Safe feature elimination for non-negativity constrained convex optimization ⋮ A comparison of numerical methods for solving multibody dynamics problems with frictional contact modeled via differential variational inequalities ⋮ Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity ⋮ Optimal subgradient methods: computational properties for large-scale linear inverse problems ⋮ Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence ⋮ PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming ⋮ Cognitive Networked Sensing and Big Data ⋮ Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems ⋮ A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem ⋮ Generalized self-concordant functions: a recipe for Newton-type methods ⋮ Block matching video compression based on sparse representation and dictionary learning ⋮ GenePEN: analysis of network activity alterations in complex diseases via the pairwise elastic net ⋮ Accurate imaging of moving targets via random sensor arrays and Kerdock codes ⋮ Adaptive restart for accelerated gradient schemes ⋮ A second-order method for strongly convex \(\ell _1\)-regularization problems

This page was built for software: TFOCS