The following pages link to (Q3079664):
Displaying 50 items.
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← 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)
- Planar quintic \(G^2\) Hermite interpolation with minimum strain energy (Q399082) (← links)
- Independent component analysis based on fast proximal gradient (Q430814) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- Operator-valued kernel-based vector autoregressive models for network inference (Q493746) (← links)
- Convex approximations to sparse PCA via Lagrangian duality (Q631218) (← links)
- Random algorithms for convex minimization problems (Q644912) (← links)
- Incremental proximal methods for large scale convex optimization (Q644913) (← links)
- On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators (Q681518) (← links)
- Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
- A closer look at consistent operator splitting and its extensions for topology optimization (Q1667461) (← links)
- A scaled gradient method for digital tomographic image reconstruction (Q1673812) (← links)
- Functional response regression analysis (Q1755123) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- Proximal algorithms in statistics and machine learning (Q1790304) (← links)
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems (Q1946618) (← links)
- Asymptotic properties on high-dimensional multivariate regression M-estimation (Q2022560) (← links)
- On the linear convergence of forward-backward splitting method. I: Convergence analysis (Q2031953) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- Fast selection of nonlinear mixed effect models using penalized likelihood (Q2072413) (← links)
- The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces (Q2080834) (← links)
- A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292) (← links)
- Enhanced flow direction arithmetic optimization algorithm for mathematical optimization problems with applications of data clustering (Q2127944) (← links)
- Sparse Bayesian learning for network structure reconstruction based on evolutionary game data (Q2137626) (← links)
- Non-convex split Feasibility problems: models, algorithms and theory (Q2165583) (← links)
- Three new iterative methods for solving inclusion problems and related problems (Q2190882) (← links)
- Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
- Fused Lasso approach in portfolio selection (Q2241053) (← links)
- Performance of first-order methods for smooth convex minimization: a novel approach (Q2248759) (← links)
- Sensitivity analysis for inference with partially identifiable covariance matrices (Q2259736) (← links)
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions (Q2359139) (← links)
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces (Q2408627) (← links)
- Nonconvex mixed TV/Cahn-Hilliard functional for super-resolution/segmentation of 3D trabecular bone images (Q2417939) (← links)
- Adaptive \(l_1\)-regularization for short-selling control in portfolio selection (Q2419515) (← links)
- Split Bregman iteration for multi-period mean variance portfolio optimization (Q2662553) (← links)
- Quadratic growth conditions and uniqueness of optimal solution to Lasso (Q2671439) (← links)
- On FISTA with a relative error rule (Q2696903) (← links)
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs (Q2806813) (← links)
- A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems (Q2897274) (← links)
- An Iterative Sparse-Group Lasso (Q3391280) (← links)
- Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA (Q3454513) (← links)
- Sensitivity Analysis for Mirror-Stratifiable Convex Functions (Q4554065) (← links)
- Computational Spectral and Ultrafast Imaging via Convex Optimization (Q4556981) (← links)
- Variational Gram Functions: Convex Analysis and Optimization (Q4602347) (← links)
- FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems (Q4646679) (← links)
- A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space (Q4972912) (← links)
- Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (Q4991666) (← links)
- (Q4998948) (← links)
