The following pages link to Yun-hai Xiao (Q385192):
Displaying 50 items.
- (Q283996) (redirect page) (← links)
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
- Global convergence of a modified limited memory BFGS method for non-convex minimization (Q385195) (← links)
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations (Q496604) (← links)
- Sufficient descent directions in unconstrained optimization (Q538309) (← links)
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing (Q540241) (← links)
- A simple sufficient descent method for unconstrained optimization (Q613840) (← links)
- (Q638840) (redirect page) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- Alternating algorithms for total variation image reconstruction from random projections (Q695456) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization (Q929334) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
- A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- An efficient algorithm for batch images alignment with adaptive rank-correction term (Q1624632) (← links)
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming (Q1741112) (← links)
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation (Q1796959) (← links)
- Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem (Q1799658) (← links)
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems (Q1932970) (← links)
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations (Q1955536) (← links)
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints (Q2059164) (← links)
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem (Q2072164) (← links)
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing (Q2257217) (← links)
- Spectral gradient projection method for monotone nonlinear equations with convex constraints (Q2271390) (← links)
- A penalty decomposition method for rank minimization problem with affine constraints (Q2282364) (← links)
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning (Q2358899) (← links)
- Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization (Q2509909) (← links)
- A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations (Q2519689) (← links)
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
- (Q3087263) (← links)
- (Q3180531) (← links)
- (Q3386365) (← links)
- (Q3405094) (← links)
- (Q3626120) (← links)
- A class of conjugate gradient methods for convex constrained monotone equations (Q4598867) (← links)
- An alternating direction method for linear‐constrained matrix nuclear norm minimization (Q4922265) (← links)
- (Q5070408) (← links)
- (Q5308226) (← links)
- An active set sequential quadratic programming algorithm for nonlinear optimisation (Q5482578) (← links)
- An efficient semismooth Newton method for adaptive sparse signal recovery problems (Q5882234) (← links)
- (Q5885141) (← links)
- Efficient dual ADMMs for sparse compressive sensing MRI reconstruction (Q6040852) (← links)
- A binary characterization method for shape convexity and applications (Q6072884) (← links)
- Convergence Analysis of Generalized ADMM with Majorization for Linearly Constrained Composite Convex Optimization (Q6395581) (← links)
