TFOCS
From MaRDI portal
Software:24763
swMATH12839MaRDI QIDQ24763FDOQ24763
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- SLOPE-adaptive variable selection via convex optimization
- Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints
- Proximal Newton-type methods for minimizing composite functions
- An inexact proximal path-following algorithm for constrained convex minimization
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- A distributed algorithm for fitting generalized additive models
- The numerics of phase retrieval
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- A direct estimation approach to sparse linear discriminant analysis
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- 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
- A comparison of numerical methods for solving multibody dynamics problems with frictional contact modeled via differential variational inequalities
- Super-resolution of positive sources: the discrete setup
- A fast splitting method tailored for Dantzig selector
- Phase retrieval from coded diffraction patterns
- Nonparametric operator-regularized covariance function estimation for functional data
- Accelerated linearized Bregman method
- A significance test for the lasso
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- A proximal-gradient homotopy method for the sparse least-squares problem
- Using Nesterov's method to accelerate multibody dynamics with friction and contact
- Low-rank spectral optimization via gauge duality
- Adaptive restart for accelerated gradient schemes
- An alternating direction method for finding Dantzig selectors
- Fast Phase Retrieval from Local Correlation Measurements
- A global sparse gradient based coupled system for image denoising
- Discussion: ``A significance test for the lasso
- Lasso screening rules via dual polytope projection
- Phase retrieval via matrix completion
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- 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
- Analysis of sparse MIMO radar
- Inexact proximal Newton methods for self-concordant functions
- PCM-TV-TFV: A Novel Two-Stage Framework for Image Reconstruction from Fourier Data
- Generalized System Identification with Stable Spline Kernels
- A tensor-based dictionary learning approach to tomographic image reconstruction
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- TILT: transform invariant low-rank textures
- FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- Book Review: A mathematical introduction to compressive sensing
- Phase retrieval for imaging problems
- Robust sparse phase retrieval made easy
- 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
- IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
- 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
- Optimization Methods for Large-Scale Machine Learning
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- Low-rank and sparse dictionary learning
- Refined analysis of sparse MIMO radar
- Discussion: ``A significance test for the lasso
- Pivotal estimation via square-root lasso in nonparametric regression
- Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence
- Composite self-concordant minimization
- Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
- Phase recovery, MaxCut and complex semidefinite programming
- Covariate-adjusted precision matrix estimation with an application in genetical genomics
- Accurate imaging of moving targets via random sensor arrays and Kerdock codes
- Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
- Double smoothing technique for large-scale linearly constrained convex optimization
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- Global registration of multiple point clouds using semidefinite programming
- Adaptive smoothing algorithms for nonsmooth composite convex minimization
- Convergence of first-order methods via the convex conjugate
- Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
- Generalized self-concordant functions: a recipe for Newton-type methods
- Chaotic analog-to-information conversion: principle and reconstructability with parameter identifiability
- An Efficient Proximity Point Algorithm for Total-Variation-Based Image Restoration
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- Polar Convolution
- A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization
- New preconditioners applied to linear programming and the compressive sensing problems
- Robust finite mixture regression for heterogeneous targets
- A proximal difference-of-convex algorithm with extrapolation
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization 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
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints
- 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
- WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions
- Robust budget allocation via continuous submodular functions
This page was built for software: TFOCS