The following pages link to UNLocBoX (Q19548):
Displaying 50 items.
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers (Q122993) (← links)
- Sparse Principal Component Analysis via Variable Projection (Q150980) (← links)
- 4D-CT reconstruction with unified spatial-temporal patch-based regularization (Q256013) (← links)
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530) (← links)
- Iterative algorithm for the split equality problem in Hilbert spaces (Q289634) (← links)
- Fundamentals of cone regression (Q289730) (← links)
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem (Q293116) (← links)
- On some steplength approaches for proximal algorithms (Q298853) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints (Q323195) (← links)
- Sharp MSE bounds for proximal denoising (Q330102) (← links)
- Low rank matrix recovery from rank one measurements (Q347516) (← links)
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms (Q368722) (← links)
- Nonlinear multilayered representation of graph-signals (Q385311) (← links)
- Distance majorization and its applications (Q403660) (← links)
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
- Sparse time-frequency representation of nonlinear and nonstationary data (Q476519) (← links)
- Compressive optical deflectometric tomography: a constrained total-variation minimization approach (Q479857) (← links)
- Stable optimizationless recovery from phaseless linear measurements (Q485222) (← links)
- Operator-valued kernel-based vector autoregressive models for network inference (Q493746) (← links)
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm'' (Q495742) (← links)
- The modified proximal point algorithm in CAT(0) spaces (Q499677) (← links)
- Computing the generalized eigenvalues of weakly symmetric tensors (Q513717) (← links)
- Decomposition methods for a spatial model for long-term energy pricing problem (Q522102) (← links)
- Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (Q530079) (← links)
- Proximity for sums of composite functions (Q536271) (← links)
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
- Fixed-point algorithms for inverse problems in science and engineering. Based on the presentations at the interdisciplinary workshop, BIRS, Banff, Canada, November 1--6, 2009. (Q633356) (← links)
- Proximal Markov chain Monte Carlo algorithms (Q2628880) (← links)
- Efficient regularization with wavelet sparsity constraints in photoacoustic tomography (Q4607820) (← links)
- Total variation superiorized conjugate gradient method for image reconstruction (Q4634746) (← links)
- Piecewise-polynomial signal segmentation using convex optimization (Q4637461) (← links)
- Variational regularization of the weighted conical Radon transform (Q4646405) (← links)
- Learning partial differential equations via data discovery and sparse optimization (Q4646838) (← links)
- CoShaRP: a convex program for single-shot tomographic shape sensing (Q4957754) (← links)
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions (Q4967326) (← links)
- The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming (Q4967363) (← links)
- Convergence of proximal gradient algorithm in the presence of adjoint mismatch <sup>*</sup> (Q4995169) (← links)
- Optimal transport in full-waveform inversion: analysis and practice of the multidimensional Kantorovich–Rubinstein norm (Q4995172) (← links)
- Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
- Strong convergence theorem for family of minimization and monotone inclusion problems in Hadamard spaces (Q5027733) (← links)
- Gradient flows and randomised thresholding: sparse inversion and classification* (Q5058108) (← links)
- Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems (Q5058176) (← links)
- Convergence rates for the joint solution of inverse problems with compressed sensing data (Q5058467) (← links)
- NETT: solving inverse problems with deep neural networks (Q5113628) (← links)
