The following pages link to (Q3174129):
Displayed 50 items.
- Feature subset selection for logistic regression via mixed integer optimization (Q301699) (← links)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- Recovering occlusion boundaries from an image (Q408866) (← links)
- Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data (Q429611) (← links)
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
- MLSLR: multilabel learning via sparse logistic regression (Q507663) (← links)
- Support vector machines based on convex risk functions and general norms (Q513637) (← links)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
- Kernel logistic regression using truncated Newton method (Q645508) (← links)
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems (Q679565) (← links)
- APPLE: approximate path for penalized likelihood estimators (Q746326) (← links)
- Another look at linear programming for feature selection via methods of regularization (Q746339) (← links)
- Optimizing optimization: accurate detection of hidden interactions in active body systems from noisy data (Q783431) (← links)
- Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization (Q827573) (← links)
- Gene selection and prediction for cancer classification using support vector machines with a reject option (Q901576) (← links)
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression (Q973867) (← links)
- Estimating time-varying networks (Q977626) (← links)
- Mixed linear system estimation and identification (Q1046675) (← links)
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming (Q1682972) (← links)
- Building up a robust risk mathematical platform to predict colorectal cancer (Q1688123) (← links)
- Multinomial regression with elastic net penalty and its grouping effect in gene selection (Q1724410) (← links)
- Logistic regression: from art to science (Q1750250) (← links)
- Dimensionality reduction for density ratio estimation in high-dimensional spaces (Q1784536) (← links)
- Recovery of seismic wavefields by an \(l_{q}\)-norm constrained regularization method (Q1785033) (← links)
- Space alternating penalized Kullback proximal point algorithms for maximizing likelihood with nondifferentiable penalty (Q1926006) (← links)
- Dimension reduction and variable selection in case control studies via regularized likelihood optimization (Q1952024) (← links)
- Spatial general autoregressive model-based image interpolation accommodates arbitrary scale factors (Q1979533) (← links)
- ADMM-softmax: an ADMM approach for multinomial logistic regression (Q1988494) (← links)
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
- Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization (Q2060804) (← links)
- Weighted thresholding homotopy method for sparsity constrained optimization (Q2082209) (← links)
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization (Q2082285) (← links)
- A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
- Estimation of dynamic systems using a method of characteristics filter (Q2125516) (← links)
- A smoothing neural network for minimization \(l_1\)-\(l_p\) in sparse signal reconstruction with measurement noises (Q2185680) (← links)
- An inexact proximal generalized alternating direction method of multipliers (Q2191781) (← links)
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
- Sparse optimization in feature selection: application in neuroimaging (Q2250090) (← links)
- Incrementally updated gradient methods for constrained and regularized optimization (Q2251572) (← links)
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis (Q2317847) (← links)
- Optimality conditions for sparse nonlinear programming (Q2361004) (← links)
- Sequence-based prediction of protein-protein interaction sites with L1-logreg classifier (Q2632642) (← links)
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction (Q2660684) (← links)
- A proximal ADMM with the Broyden family for convex optimization problems (Q2666686) (← links)
- A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression (Q2830631) (← links)
- Gap Safe screening rules for sparsity enforcing penalties (Q4637055) (← links)
- Large‐scale regression‐based pattern discovery: The example of screening the WHO global drug safety database (Q4969717) (← links)