Zhaosong Lu
Orcid: 0000-0003-3277-7853
According to our database1,
Zhaosong Lu
authored at least 69 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization.
Comput. Optim. Appl., December, 2024
Augmented Lagrangian method for tensor low-rank and sparsity models in multi-dimensional image recovery.
Adv. Comput. Math., August, 2024
J. Comput. Graph. Stat., 2024
Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees.
CoRR, 2024
Single-loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions.
CoRR, 2024
2023
Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient.
SIAM J. Optim., September, 2023
A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees.
SIAM J. Optim., September, 2023
Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming.
SIAM J. Optim., June, 2023
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees.
SIAM J. Optim., June, 2023
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization.
Optim. Methods Softw., March, 2023
A Parameter-Free Conditional Gradient Method for Composite Minimization under Hölder Condition.
J. Mach. Learn. Res., 2023
FastPicker: Adaptive independent two-stage video-to-video summarization for efficient action recognition.
Neurocomputing, 2023
Newton-CG methods for nonconvex unconstrained optimization with Hölder continuous Hessian.
CoRR, 2023
CoRR, 2023
Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization.
Proceedings of the International Conference on Machine Learning, 2023
2022
Math. Oper. Res., 2022
Primal-dual extrapolation methods for monotone inclusions under local Lipschitz continuity with applications to variational inequality, conic constrained saddle point, and convex conic optimization problems.
CoRR, 2022
2021
Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems.
SIAM J. Optim., 2021
2019
Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming.
SIAM J. Optim., 2019
Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization.
Math. Program., 2019
2018
Math. Oper. Res., 2018
Generalized Conjugate Gradient Methods for <i>ℓ</i><sub>1</sub> Regularized Convex Quadratic Programming with Finite Convergence.
Math. Oper. Res., 2018
2017
A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming.
SIAM J. Numer. Anal., 2017
SIAM J. Numer. Anal., 2017
Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization.
SIAM J. Optim., 2017
\(\ell _p\) Regularized low-rank approximation via iterative reweighted singular value minimization.
Comput. Optim. Appl., 2017
2016
SIAM J. Optim., 2016
An efficient optimization approach for a cardinality-constrained index tracking problem.
Optim. Methods Softw., 2016
2015
SIAM J. Sci. Comput., 2015
SIAM J. Sci. Comput., 2015
An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization.
SIAM J. Optim., 2015
Math. Program., 2015
Generalized Conjugate Gradient Methods for ℓ<sub>1</sub> Regularized Convex Quadratic Programming with Finite Convergence.
CoRR, 2015
CoRR, 2015
2014
Iterative reweighted minimization methods for l<sub>p</sub> regularized unconstrained nonlinear programming.
Math. Program., 2014
Iterative hard thresholding methods for l<sub>0</sub> regularized convex cone programming.
Math. Program., 2014
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
Proceedings of the 31th International Conference on Machine Learning, 2014
2013
SIAM J. Matrix Anal. Appl., 2013
Optim. Methods Softw., 2013
Math. Comput., 2013
INFORMS J. Comput., 2013
Randomized Block Coordinate Non-Monotone Gradient Method for a Class of Nonlinear Programming.
CoRR, 2013
FeaFiner: biomarker identification from medical data through feature generalization and selection.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013
A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems.
Proceedings of the 30th International Conference on Machine Learning, 2013
2012
Math. Program., 2012
Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression.
Math. Program., 2012
Comput. Stat. Data Anal., 2012
CoRR, 2012
Iterative Reweighted Minimization Methods for $l_p$ Regularized Unconstrained Nonlinear Programming
CoRR, 2012
2011
Optim. Methods Softw., 2011
A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set.
Math. Program., 2011
Primal-dual first-order methods with <i>O</i>(1/e) iteration-complexity for cone programming.
Math. Program., 2011
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011
2010
SIAM J. Matrix Anal. Appl., 2010
2009
An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners.
Optim. Methods Softw., 2009
2007
Limiting behavior of the Alizadeh-Haeberly-Overton weighted paths in semidefinite programming.
Optim. Methods Softw., 2007
Math. Program., 2007
Math. Program., 2007
2006
An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming.
SIAM J. Optim., 2006
2005
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.
SIAM J. Optim., 2005
Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2.
SIAM J. Optim., 2005
2004
INFORMS J. Comput., 2004