The following pages link to Zhaosong Lu (Q463720):
Displaying 50 items.
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721) (← links)
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454) (← links)
- A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set (Q623460) (← links)
- Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression (Q662292) (← links)
- An augmented Lagrangian approach for sparse principal component analysis (Q715084) (← links)
- A modified nearly exact method for solving low-rank trust region subproblem (Q868456) (← links)
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm (Q868467) (← links)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
- An alternating direction method for finding Dantzig selectors (Q1927184) (← links)
- A framelet algorithm for de-blurring images corrupted by multiplicative noise (Q2306753) (← links)
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
- An efficient optimization approach for a cardinality-constrained index tracking problem (Q2815504) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
- Optimal Solutions for the Closest-String Problem via Integer Programming (Q2890443) (← links)
- Penalty decomposition methods for rank minimization (Q2943834) (← links)
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming (Q2957850) (← links)
- Adaptive First-Order Methods for General Sparse Inverse Covariance Selection (Q3053132) (← links)
- Robust portfolio selection based on a joint ellipsoidal uncertainty set (Q3093036) (← links)
- Minimizing Condition Number via Convex Programming (Q3225534) (← links)
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners (Q3603659) (← links)
- Smooth Optimization Approach for Sparse Covariance Selection (Q3648531) (← links)
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
- $\ell _0$ Minimization for wavelet frame based image restoration (Q4912013) (← links)
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
- Dimension Reduction and Coefficient Estimation in Multivariate Linear Regression (Q5087443) (← links)
- Generalized Conjugate Gradient Methods for <i>ℓ</i><sub>1</sub> Regularized Convex Quadratic Programming with Finite Convergence (Q5219295) (← links)
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms (Q5219700) (← links)
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930) (← links)
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion (Q5251927) (← links)
- Fused Multiple Graphical Lasso (Q5254994) (← links)
- Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map <i>X</i>1/2<i>SX</i>1/2 (Q5317500) (← links)
- A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh--Haeberly--Overton Search Direction (Q5317541) (← links)
- Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
- $ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames (Q5383308) (← links)
- Sparse Approximation via Penalty Decomposition Methods (Q5408227) (← links)
- Computing Optimal Experimental Designs via Interior Point Method (Q5413661) (← links)
- Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming (Q5437530) (← links)
- An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming (Q5470255) (← links)
- A Proximal Gradient Method for Ensemble Density Functional Theory (Q5502093) (← links)
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems (Q5741071) (← links)
- An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems (Q5857317) (← links)
- Penalty and Augmented Lagrangian Methods for Constrained DC Programming (Q5868956) (← links)
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization (Q5882242) (← links)
- A new nonconvex low-rank tensor approximation method with applications to hyperspectral images denoising (Q6042940) (← links)
- Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient (Q6046830) (← links)
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) (← links)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
