| Publication | Date of Publication | Type |
|---|
An Accelerated Proximal Alternating Direction Method of Multipliers for Optimal Decentralized Control of Uncertain Systems
(available as arXiv preprint) | N/A | Paper |
An efficient sieving based secant method for sparse optimization problems with least-squares constraints
(available as arXiv preprint) | N/A | Paper |
Low-rank quaternion tensor completion for color video inpainting via a novel factorization strategy
(available as arXiv preprint) | N/A | Paper |
Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization
(available as arXiv preprint) | N/A | Paper |
Accelerating preconditioned ADMM via degenerate proximal point mappings
(available as arXiv preprint) | N/A | Paper |
On the relationships among GPU-accelerated first-order methods for solving linear programming
Journal of Computational Mathematics | 2027-01-01 | Paper |
Two typical implementable semismooth^* Newton methods for generalized equations are G-semismooth Newton methods
Mathematics of Operations Research | 2026-09-15 | Paper |
Low-Rank Tensor Completion using Tensor Train Decomposition via Riemannian Optimization on the Quotient Geometry
(available as arXiv preprint) | 2026-06-29 | Paper |
A complete error analysis of PINNs for elliptic equations using projected stochastic gradient descent
Communications in Computational Physics | 2026-06-16 | Paper |
LAMBDA: A Large Model Based Data Agent
Journal of the American Statistical Association | 2026-04-21 | Paper |
Rejoinder to the Discussions on “LAMBDA: A Large Model Based Data Agent”
Journal of the American Statistical Association | 2026-04-21 | Paper |
HPR-LP: an implementation of an HPR method for solving linear programming
Mathematical Programming Computation | 2026-04-15 | Paper |
Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming
Mathematical Programming. Series A. Series B | 2026-01-16 | Paper |
The global well-posedness for master equations of mean field games of controls
(available as arXiv preprint) | 2026-01-01 | Paper |
A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
(available as arXiv preprint) | 2026-01-01 | Paper |
A symmetric Gauss-Seidel based alternating proximal ALM for generalized Nash Equilibrium problems in Banach spaces
(available as arXiv preprint) | 2026-01-01 | Paper |
Factorized low-rank matrix recovery problem, Schatten-q quasi-norm, Error bound for critical point, Kurdyka-Łojasiewicz property, Inexact proximal alternating linearized minimization
(available as arXiv preprint) | 2026-01-01 | Paper |
A Semismooth Newton Augmented Lagrangian Method for Sparse Spectral Risk Optimization
(available as arXiv preprint) | 2026-01-01 | Paper |
Maximal monotonicity of piecewise polyhedral mappings
(available as arXiv preprint) | 2026-01-01 | Paper |
Convergence Analysis of the Restarted Moving-Anchored Extra-Gradient Method in the Absence of Local Lipschitz Continuity
(available as arXiv preprint) | 2026-01-01 | Paper |
Robust mean field control: an application to optimal execution under composite uncertainty
(available as arXiv preprint) | 2026-01-01 | Paper |
ADMM Fails to Achieve an $O(K^{-1})$ Ergodic KKT Residual Bound
(available as arXiv preprint) | 2026-01-01 | Paper |
Semidefinite Implementations of the Proximal Point Algorithm and Consequences for Progressive Decoupling in Optimization
(available as arXiv preprint) | 2026-01-01 | Paper |
Learning Universal Costs via Multi-Observation Inverse Optimal Transport
(available as arXiv preprint) | 2026-01-01 | Paper |
Solution Set Dimensions in Convex Optimization and Primal-Polar Facial Signatures
(available as arXiv preprint) | 2026-01-01 | Paper |
GPU-Accelerated Preprocessing for Large-Scale Linear Programming
(available as arXiv preprint) | 2026-01-01 | Paper |
Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing
Mathematical Programming Computation | 2026-01-01 | Paper |
On the Nonoccurrence of Gradient Restart in Nesterov Accelerated Gradient Method
(available as arXiv preprint) | 2026-01-01 | Paper |
Randomly projected convex clustering model: motivation, realization, and cluster recovery guarantees
Journal of Machine Learning Research (JMLR) | 2025-12-09 | Paper |
A squared smoothing Newton method for semidefinite programming
Mathematics of Operations Research | 2025-11-26 | Paper |
Adaptive sieving: a dimension reduction technique for sparse optimization problems
Mathematical Programming Computation | 2025-10-22 | Paper |
Quantifying low rank approximations of third order symmetric tensors
Mathematical Programming. Series A. Series B | 2025-09-09 | Paper |
The sign and the co-monotonicity of Z for a class of decoupled FBSDEs: theory and applications
Systems & Control Letters | 2025-07-17 | Paper |
Low-rank quaternion tensor completion for color video inpainting via a novel factorization strategy
Mathematics of Computation | 2025-07-03 | Paper |
Accelerating preconditioned ADMM via degenerate proximal point mappings
SIAM Journal on Optimization | 2025-06-05 | Paper |
Aubin property and strong regularity are equivalent for nonlinear second-order cone programming
SIAM Journal on Optimization | 2025-04-23 | Paper |
Solving polynomial variational inequality problems via Lagrange multiplier expressions and moment-SOS relaxations
Computational Optimization and Applications | 2025-03-25 | Paper |
An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
Journal of Optimization Theory and Applications | 2025-01-13 | Paper |
Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
(available as arXiv preprint) | 2025-01-01 | Paper |
HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
(available as arXiv preprint) | 2025-01-01 | Paper |
On the p-order Semismoothness of the Metric Projection onto Slices of the Positive Semidefinite Cone
(available as arXiv preprint) | 2025-01-01 | Paper |
The Aubin Property for Generalized Equations over C²-cone Reducible Sets
(available as arXiv preprint) | 2025-01-01 | Paper |
On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
(available as arXiv preprint) | 2025-01-01 | Paper |
On Error Bounds for Rank-Constrained Affine Matrix Sets
(available as arXiv preprint) | 2025-01-01 | Paper |
A highly efficient algorithm for solving exclusive lasso problems
Optimization Methods & Software | 2024-11-20 | Paper |
Learning graph Laplacian with MCP
Optimization Methods & Software | 2024-11-20 | Paper |
Subgroup analysis in the heterogeneous Cox model
Statistics in Medicine | 2024-10-29 | Paper |
A decomposition method for the group-based quay crane scheduling problem
INFORMS Journal on Computing | 2024-07-29 | Paper |
An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
SIAM Journal on Optimization | 2024-06-25 | Paper |
Convex and Nonconvex Risk-Based Linear Regression at Scale
INFORMS Journal on Computing | 2024-03-22 | Paper |
Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming
(available as arXiv preprint) | 2024-01-01 | Paper |
Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
(available as arXiv preprint) | 2024-01-01 | Paper |
HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems
(available as arXiv preprint) | 2024-01-01 | Paper |
Characterizations of the Aubin Property of the Solution Mapping for Nonlinear Semidefinite Programming
(available as arXiv preprint) | 2024-01-01 | Paper |
HPR-LP: An implementation of an HPR method for solving linear programming
(available as arXiv preprint) | 2024-01-01 | Paper |
Lipschitz stability of least-squares problems regularized by functions with $\mathcal{C}^2$-cone reducible conjugates
(available as arXiv preprint) | 2024-01-01 | Paper |
Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing
(available as arXiv preprint) | 2024-01-01 | Paper |
Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
Computational Optimization and Applications | 2023-10-19 | Paper |
| Quantifying low rank approximations of third order symmetric tensors | 2023-07-20 | Paper |
A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
European Journal of Operational Research | 2023-07-10 | Paper |
| Adaptive sieving: A dimension reduction technique for sparse optimization problems | 2023-06-29 | Paper |
| A Highly Efficient Algorithm for Solving Exclusive Lasso Problems | 2023-06-25 | Paper |
QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems
ACM Transactions on Mathematical Software | 2023-03-29 | Paper |
| Solving polynomial variational inequality problems via Lagrange multiplier expressions and Moment-SOS relaxations | 2023-03-21 | Paper |
| A squared smoothing Newton method for semidefinite programming | 2023-03-10 | Paper |
Solvability of monotone tensor complementarity problems
Science China. Mathematics | 2023-03-09 | Paper |
| An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity | 2022-11-27 | Paper |
A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
SIAM Journal on Optimization | 2022-09-29 | Paper |
On degenerate doubly nonnegative projection problems
Mathematics of Operations Research | 2022-09-26 | Paper |
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems
Mathematical Programming Computation | 2022-06-16 | Paper |
Robust tensor completion: equivalent surrogates, error bounds, and algorithms
SIAM Journal on Imaging Sciences | 2022-06-01 | Paper |
Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
Journal of Computational and Graphical Statistics | 2022-03-28 | Paper |
An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity
(available as arXiv preprint) | 2022-01-01 | Paper |
An inexact augmented Lagrangian method for second-order cone programming with applications
SIAM Journal on Optimization | 2021-07-20 | Paper |
scientific article; zbMATH DE number 7370526 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-09 | Paper |
| scientific article; zbMATH DE number 7370526 (Why is no real title available?) | 2021-07-09 | Paper |
A fast globally linearly convergent algorithm for the computation of Wasserstein barycenters
(available as arXiv preprint) | 2021-07-09 | Paper |
| A fast globally linearly convergent algorithm for the computation of Wasserstein barycenters | 2021-07-09 | Paper |
An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems
SIAM Journal on Mathematics of Data Science | 2021-07-06 | Paper |
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
European Journal of Operational Research | 2021-06-04 | Paper |
QPPAL: A two-phase proximal augmented Lagrangian method for high dimensional convex quadratic programming problems
(available as arXiv preprint) | 2021-03-24 | Paper |
scientific article; zbMATH DE number 7306909 (Why is no real title available?)
(available as arXiv preprint) | 2021-02-05 | Paper |
| scientific article; zbMATH DE number 7306909 (Why is no real title available?) | 2021-02-05 | Paper |
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
Mathematical Programming. Series A. Series B | 2021-01-25 | Paper |
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
Mathematical Programming Computation | 2021-01-25 | Paper |
A unified algorithmic framework of symmetric Gauss-Seidel decomposition based proximal ADMMs for convex composite programming
Journal of Computational Mathematics | 2020-10-27 | Paper |
| Adaptive Sieving with PPDNA: Generating Solution Paths of Exclusive Lasso Models | 2020-09-18 | Paper |
An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
SIAM Journal on Optimization | 2020-09-17 | Paper |
A proximal point dual Newton algorithm for solving group graphical Lasso problems
SIAM Journal on Optimization | 2020-08-18 | Paper |
Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
Mathematics of Operations Research | 2020-03-12 | Paper |
Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
SIAM Journal on Optimization | 2020-02-25 | Paper |
Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
(available as arXiv preprint) | 2020-02-07 | Paper |
| Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method | 2020-02-07 | Paper |
| scientific article; zbMATH DE number 7156558 (Why is no real title available?) | 2020-01-22 | Paper |
An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
| Mesh Independence of a Majorized ABCD Method for Sparse PDE-constrained Optimization Problems | 2020-01-03 | Paper |
Mesh Independence of a Majorized ABCD Method for Sparse PDE-constrained Optimization Problems
(available as arXiv preprint) | 2020-01-01 | Paper |
Adaptive Sieving with PPDNA: Generating Solution Paths of Exclusive Lasso Models
(available as arXiv preprint) | 2020-01-01 | Paper |
Best nonnegative rank-one approximations of tensors
SIAM Journal on Matrix Analysis and Applications | 2019-12-09 | Paper |
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
Optimization Methods & Software | 2019-11-25 | Paper |
Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
SIAM Journal on Optimization | 2019-11-08 | Paper |
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
Mathematical Programming. Series A. Series B | 2019-10-22 | Paper |
Efficient sparse semismooth Newton methods for the clustered Lasso problem
SIAM Journal on Optimization | 2019-08-27 | Paper |
