scientific article
From MaRDI portal
Publication:2896066
zbMath1242.68262MaRDI QIDQ2896066
Publication date: 13 July 2012
Full work available at URL: http://www.jmlr.org/papers/v11/zhang10a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, Inexact proximal DC Newton-type method for nonconvex composite functions, An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems, A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems, Patch-based weighted SCAD prior for compressive sensing, Exact penalization for cardinality and rank-constrained optimization problems via partial regularization, Best subset selection via a modern optimization lens, Oracle inequalities for the Lasso in the high-dimensional Aalen multiplicative intensity model, A proximal dual semismooth Newton method for zero-norm penalized quantile regression estimator, A data-driven line search rule for support recovery in high-dimensional data analysis, A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations, Robust projection twin support vector machine via DC programming, Proximal average approximated incremental gradient descent for composite penalty regularized empirical risk minimization, Variational image colorization models using higher-order Mumford-Shah regularizers, Nonconvex regularization for sparse neural networks, The springback penalty for robust signal recovery, Robust low transformed multi-rank tensor methods for image alignment, Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression, Separating variables to accelerate non-convex regularized optimization, Robust capped L1-norm twin support vector machine, Alternating direction method of multipliers for nonconvex fused regression problems, Transformed \(\ell_1\) regularization for learning sparse deep neural networks, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint, Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm, Efficient nonconvex sparse group feature selection via continuous and discrete optimization, Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems, A nonconvex model with minimax concave penalty for image restoration, Solution methodologies for minimizing a sum of pointwise minima of two functions, Capped \(L_{2,p}\)-norm metric based robust least squares twin support vector machine for pattern classification, Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm, Penalized wavelet nonparametric univariate logistic regression for irregular spaced data, A nonconvex nonsmooth image prior based on the hyperbolic tangent function, An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming, Structural properties of affine sparsity constraints, \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization, Accelerated matrix completion algorithm using continuation strategy and randomized SVD, Retire: robust expectile regression in high dimensions, Alternating direction method of multipliers for nonconvex log total variation image restoration, Multi-stage convex relaxation for feature selection, High-dimensional additive hazards models and the lasso, Calibrating nonconvex penalized regression in ultra-high dimension, A new nonconvex approach to low-rank matrix completion with application to image inpainting, A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations, On the finite-sample analysis of \(\Theta\)-estimators, Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery, A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery, Hard thresholding regression, A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem, On the finite-sample analysis of \(\Theta\)-estimators, Optimal computational and statistical rates of convergence for sparse nonconvex learning problems, Minimizing a sum of clipped convex functions, Unnamed Item, On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression, Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis, A Tuning-free Robust and Efficient Approach to High-dimensional Regression, An efficient non-convex total variation approach for image deblurring and denoising, I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error, Truncated $L^1$ Regularized Linear Regression: Theory and Algorithm, Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, Nonconcave penalized composite conditional likelihood estimation of sparse Ising models, A novel robust principal component analysis algorithm of nonconvex rank approximation, Delete or merge regressors for linear model selection, A support-denoiser-driven framework for single image restoration, Unnamed Item, Stochastic nonlocal damage analysis by a machine learning approach, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems, Proximal gradient method with automatic selection of the parameter by automatic differentiation, Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem, Fixed point quasiconvex subgradient method, Sorted concave penalized regression, Strong oracle optimality of folded concave penalized estimation, A unified primal dual active set algorithm for nonconvex sparse recovery, A selective review of group selection in high-dimensional models, A general theory of concave regularization for high-dimensional sparse estimation problems, Efficient nonsmooth nonconvex optimization for image restoration and segmentation, Computation of second-order directional stationary points for group sparse optimization, On integer and MPCC representability of affine sparsity, Iteratively reweighted \(\ell_1\)-penalized robust regression, Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Correntropy-based metric for robust twin support vector machine, Computational and statistical analyses for robust non-convex sparse regularized regression problem, Sparse classification: a scalable discrete optimization perspective, Matrix completion via minimizing an approximate rank, Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning, Unnamed Item, Sparse radial basis function approximation with spatially variable shape parameters, Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation, The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms, A theoretical understanding of self-paced learning, Weighted thresholding homotopy method for sparsity constrained optimization, Variable selection in convex quantile regression: \(\mathcal{L}_1\)-norm or \(\mathcal{L}_0\)-norm regularization?, Novel harmonic regularization approach for variable selection in Cox's proportional hazards model, An interior point method for \(L_{1 / 2}\)-SVM and application to feature selection in classification, A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration, Penalized wavelet estimation and robust denoising for irregular spaced data, Unnamed Item, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions, Towards Statistically Provable Geometric 3D Human Pose Recovery, Unnamed Item, An alternating direction method with continuation for nonconvex low rank minimization
