TFOCS

swMATH12839MaRDI QIDQ24763FDOQ24763

Author name not available (Why is that?)

Official website: http://tfocs.stanford.edu/

Described by source

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

Cited In (only showing first 100 items - show all)

• SLOPE-adaptive variable selection via convex optimization
• Optimal subgradient methods: computational properties for large-scale linear inverse problems
• A second-order method for strongly convex \(\ell _1\)-regularization problems
• A direct estimation approach to sparse linear discriminant analysis
• Adventures in compressive sensing based MIMO radar
• Analysis and design of optimization algorithms via integral quadratic constraints
• Robust subspace clustering
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• Super-resolution of positive sources: the discrete setup
• Phase retrieval from coded diffraction patterns
• A significance test for the lasso
• Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
• Low-rank spectral optimization via gauge duality
• Adaptive restart for accelerated gradient schemes
• Fast Phase Retrieval from Local Correlation Measurements
• Discussion: ``A significance test for the lasso
• An inexact successive quadratic approximation method for L-1 regularized optimization
• OSGA: a fast subgradient algorithm with optimal complexity
• An accelerated proximal gradient algorithm for frame-based image restoration via the balanced approach
• The linearized alternating direction method of multipliers for Dantzig selector
• Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
• A tensor-based dictionary learning approach to tomographic image reconstruction
• TILT: transform invariant low-rank textures
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
• PDCO
• SNLSDP
• BLOOMP
• NESTA
• LS-SVMlab
• Sparco
• UNLocBoX
• ParNes
• CoSaMP
• SPGL1
• AIR tools
• TVAL3
• FISTA
• Yall1
• na24
• SparseLOGREG
• FPC_AS
• flare
• L1-MAGIC
• BMSS
• SLEP
• EdgeCS
• l1_ls
• gglasso
• Linear Time Frequency Analysis Toolbox
• Chrono
• OSGA
• covTest
• FPC
• IMRO
• L1TestPack
• PNOPT
• SpaRSA
• TwIST
• PhasePack
• GESPAR
• SparsePR
• FOM
• IPsolve
• NESUN
• PyLops
• BlockPR
• 2EBD-HPE
• PhaseLift
• spsim
• SHARP
• RRR
• Phase retrieval for imaging problems
• Robust sparse phase retrieval made easy
• PyHST2
• ProxImaL
• Rejoinder: ``A significance test for the lasso
• Tomographic image reconstruction using training images
• Optimal subgradient algorithms for large-scale convex optimization in simple domains
• Implementation of an optimal first-order method for strongly convex total variation regularization
• Conic optimization via operator splitting and homogeneous self-dual embedding
• A survey of compressed sensing
• Sparse microwave imaging: principles and applications
• Learning with tensors: a framework based on convex optimization and spectral regularization
• Discussion: ``A significance test for the lasso
• Pivotal estimation via square-root lasso in nonparametric regression
• Phase recovery, MaxCut and complex semidefinite programming
• Covariate-adjusted precision matrix estimation with an application in genetical genomics
• IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
• Generalized system identification with stable spline kernels
• FOM -- a MATLAB toolbox of first-order methods for solving convex optimization problems
• Double smoothing technique for large-scale linearly constrained convex optimization
• Global registration of multiple point clouds using semidefinite programming
• Short-term memory capacity in networks via the restricted isometry property
• Chaotic analog-to-information conversion: principle and reconstructability with parameter identifiability
• New preconditioners applied to linear programming and the compressive sensing problems
• An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
• GenePEN: analysis of network activity alterations in complex diseases via the pairwise elastic net
• Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
• The Moreau envelope based efficient first-order methods for sparse recovery
• A new homotopy proximal variable-metric framework for composite convex minimization

This page was built for software: TFOCS