TFOCS
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Nonparametric operator-regularized covariance function estimation for functional data
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Smoothed _1-regularization-based line search for sparse signal recovery
- Accelerated first-order methods for hyperbolic programming
- SNLSDP
- Convergence of first-order methods via the convex conjugate
- PDCO
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- A proximal difference-of-convex algorithm with extrapolation
- The matrix completion method for phase retrieval from fractional Fourier transform magnitudes
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- BLOOMP
- NESTA
- An alternating direction method for finding Dantzig selectors
- TILT: transform invariant low-rank textures
- Sparco
- LS-SVMlab
- Accelerated linearized Bregman method
- Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework
- UNLocBoX
- A partially proximal linearized alternating minimization method for finding Dantzig selectors
- 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
- SPGL1
- ParNes
- Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval
- TVAL3
- CoSaMP
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
- AIR tools
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- New preconditioners applied to linear programming and the compressive sensing problems
- PRP-like algorithm for monotone operator equations
- 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
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Robust finite mixture regression for heterogeneous targets
- Yall1
- 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
- Generalized self-concordant functions: a recipe for Newton-type methods
- Block matching video compression based on sparse representation and dictionary learning
- FISTA
- SparseLOGREG
- na24
- GenePEN: analysis of network activity alterations in complex diseases via the pairwise elastic net
- Adaptive restart for accelerated gradient schemes
- Refined analysis of sparse MIMO radar
- A secant-based Nesterov method for convex functions
- A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization
- Performance of first- and second-order methods for _1-regularized least squares problems
- FPC_AS
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- flare
- L1-MAGIC
- A relaxed-PPA contraction method for sparse signal recovery
- Phase recovery, MaxCut and complex semidefinite programming
- Phase retrieval from coded diffraction patterns
- BMSS
- SLEP
- EdgeCS
- l1_ls
- gglasso
- The Moreau envelope based efficient first-order methods for sparse recovery
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Linear Time Frequency Analysis Toolbox
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula
- Super-resolution of positive sources: the discrete setup
- Using Nesterov's method to accelerate multibody dynamics with friction and contact
- Low-rank spectral optimization via gauge duality
- Phase retrieval from low-rate samples
- OSGA
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Cognitive Networked Sensing and Big Data
- A proximal-gradient homotopy method for the sparse least-squares problem
- Chrono
- Accurate imaging of moving targets via random sensor arrays and Kerdock codes
- Double smoothing technique for large-scale linearly constrained convex optimization
- Proximal Newton-type methods for minimizing composite functions
- Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation
- Adventures in compressive sensing based MIMO radar
- Matrix-free convex optimization modeling
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- An accelerated proximal gradient algorithm for frame-based image restoration via the balanced approach
- An inexact successive quadratic approximation method for L-1 regularized optimization
This page was built for software: TFOCS
