The following pages link to (Q3320132):
Displaying 50 items.
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis (Q97534) (← links)
- Minimax and Minimax Projection Designs Using Clustering (Q123949) (← links)
- A reweighted \(\ell^2\) method for image restoration with Poisson and mixed Poisson-Gaussian noise (Q256075) (← links)
- Diffusion tensor imaging with deterministic error bounds (Q294434) (← links)
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces (Q300769) (← links)
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- A linear-time algorithm for trust region problems (Q304248) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Optimized first-order methods for smooth convex minimization (Q312663) (← links)
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- Fast convex optimization via inertial dynamics with Hessian driven damping (Q324582) (← links)
- Efficient valuation of SCR via a neural network approach (Q344299) (← links)
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization (Q368088) (← links)
- Clustering and feature selection using sparse principal component analysis (Q374668) (← links)
- Domain adaptation and sample bias correction theory and algorithm for regression (Q391745) (← links)
- Operator splittings, Bregman methods and frame shrinkage in image processing (Q408893) (← links)
- Robust least square semidefinite programming with applications (Q457207) (← links)
- A stable method solving the total variation dictionary model with \(L^\infty\) constraints (Q479864) (← links)
- Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions (Q507334) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- A global piecewise smooth Newton method for fast large-scale model predictive control (Q644265) (← links)
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection (Q644904) (← links)
- Random algorithms for convex minimization problems (Q644912) (← links)
- Lagrangian penalization scheme with parallel forward-backward splitting (Q725876) (← links)
- Accelerated proximal algorithms with a correction term for monotone inclusions (Q832632) (← links)
- iPiasco: inertial proximal algorithm for strongly convex optimization (Q890114) (← links)
- Feature-aware regularization for sparse online learning (Q893629) (← links)
- Metric selection in fast dual forward-backward splitting (Q901087) (← links)
- Information-based complexity of linear operator equations (Q1194382) (← links)
- Augmented Lagrangian algorithms for linear programming (Q1321268) (← links)
- A regularizing multilevel approach for nonlinear inverse problems (Q1615866) (← links)
- Stochastic accelerated alternating direction method of multipliers with importance sampling (Q1626518) (← links)
- A convergent least-squares regularized blind deconvolution approach (Q1636832) (← links)
- Comparison of minimization methods for nonsmooth image segmentation (Q1642276) (← links)
- Sparse estimation of high-dimensional correlation matrices (Q1660228) (← links)
- A new fast algorithm for constrained four-directional total variation image denoising problem (Q1666647) (← links)
- Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization (Q1675555) (← links)
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix (Q1677473) (← links)
- Large-scale eigenvector approximation via Hilbert space embedding Nyström (Q1677860) (← links)
- A conjugate subgradient algorithm with adaptive preconditioning for the least absolute shrinkage and selection operator minimization (Q1682919) (← links)
- An efficient primal-dual method for the obstacle problem (Q1685519) (← links)
- A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552) (← links)
- A semi-analytical approach for the positive semidefinite Procrustes problem (Q1688909) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- Stochastic heavy ball (Q1697485) (← links)
- On the reconstruction of media inhomogeneity by inverse wave scattering model (Q1703878) (← links)
- The Shannon total variation (Q1703959) (← links)
- Convergence of damped inertial dynamics governed by regularized maximally monotone operators (Q1708130) (← links)
