swMATH12839MaRDI QIDQ24763FDOQ24763
Author name not available (Why is that?)
Official website: http://tfocs.stanford.edu/
Cited In (only showing first 100 items - show all)
- 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
- Convergence of first-order methods via the convex conjugate
- A distributed algorithm for fitting generalized additive models
- The numerics of phase retrieval
- 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
- Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
- A comparison of numerical methods for solving multibody dynamics problems with frictional contact modeled via differential variational inequalities
- Generalized self-concordant functions: a recipe for Newton-type methods
- 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
- A fast splitting method tailored for Dantzig selector
- Nonparametric operator-regularized covariance function estimation for functional data
- A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization
- Accelerated linearized Bregman method
- Generalized conjugate gradient methods for \(\ell_1\) regularized convex quadratic programming with finite convergence
- Robust finite mixture regression for heterogeneous targets
- A proximal-gradient homotopy method for the sparse least-squares problem
- Using Nesterov's method to accelerate multibody dynamics with friction and contact
- 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 alternating direction method for finding Dantzig selectors
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- Optimization methods for large-scale machine learning
- A global sparse gradient based coupled system for image denoising
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints
- Lasso screening rules via dual polytope projection
- Phase retrieval via matrix completion
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- Robust budget allocation via continuous submodular functions
- 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
- 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
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- The matrix completion method for phase retrieval from fractional Fourier transform magnitudes
- Book Review: A mathematical introduction to compressive sensing
- A partially proximal linearized alternating minimization method for finding Dantzig selectors
- Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval
- Super-resolution radar
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- Phase retrieval from low-rate samples
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- A single-phase, proximal path-following framework
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- A relaxed-PPA contraction method for sparse signal recovery
- Low-rank and sparse dictionary learning
- PRP-like algorithm for monotone operator equations
- Refined analysis of sparse MIMO radar
- Composite self-concordant minimization
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
- Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery
- 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
- Accelerated first-order methods for hyperbolic programming
- Adaptive smoothing algorithms for nonsmooth composite convex minimization
- 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
- Matrix-free convex optimization modeling
- A secant-based Nesterov method for convex functions
- Polar convolution
- An acceleration procedure for optimal first-order methods
- A time continuation based fast approximate algorithm for compressed sensing related optimization
- Numerical solution of an inverse random source problem for the time fractional diffusion equation via PhaseLift
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- Cognitive Networked Sensing and Big Data
- Safe feature elimination for non-negativity constrained convex optimization
- Computing ground states of Bose-Einstein condensates with higher order interaction via a regularized density function formulation
- Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- Eigenvalue-free iterative shrinkage-thresholding algorithm for solving the linear inverse problems
- Multicompartment magnetic resonance fingerprinting
- Block matching video compression based on sparse representation and dictionary learning
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula
- 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
This page was built for software: TFOCS
