| Publication | Date of Publication | Type |
|---|
A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
Computational Optimization and Applications | 2024-11-25 | Paper |
A nonlocal Kronecker-basis-representation method for low-dose CT sinogram recovery
Journal of Computational Mathematics | 2024-10-09 | Paper |
Augmented Lagrangian method for tensor low-rank and sparsity models in multi-dimensional image recovery
Advances in Computational Mathematics | 2024-09-10 | Paper |
Exactly Uncorrelated Sparse Principal Component Analysis
Journal of Computational and Graphical Statistics | 2024-06-10 | Paper |
First-order penalty methods for bilevel optimization
SIAM Journal on Optimization | 2024-06-06 | Paper |
Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient
SIAM Journal on Optimization | 2023-09-06 | Paper |
A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
SIAM Journal on Optimization | 2023-08-11 | Paper |
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees
SIAM Journal on Optimization | 2023-07-12 | Paper |
Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming
SIAM Journal on Optimization | 2023-06-27 | Paper |
A Parameter-Free Conditional Gradient Method for Composite Minimization under H\"older Condition
| 2023-05-29 | Paper |
A new nonconvex low-rank tensor approximation method with applications to hyperspectral images denoising
Inverse Problems | 2023-05-04 | Paper |
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
Optimization Methods & Software | 2023-03-15 | Paper |
Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization
| 2023-03-05 | Paper |
Penalty and augmented Lagrangian methods for constrained DC programming
Mathematics of Operations Research | 2022-09-26 | Paper |
Dimension Reduction and Coefficient Estimation in Multivariate Linear Regression
Journal of the Royal Statistical Society Series B: Statistical Methodology | 2022-07-11 | Paper |
Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
SIAM Journal on Optimization | 2021-08-24 | Paper |
An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
IMA Journal of Numerical Analysis | 2021-03-31 | Paper |
A framelet algorithm for de-blurring images corrupted by multiplicative noise
Applied Mathematical Modelling | 2020-03-26 | Paper |
Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
Mathematics of Operations Research | 2020-03-12 | Paper |
Generalized conjugate gradient methods for \(\ell_1\) regularized convex quadratic programming with finite convergence
Mathematics of Operations Research | 2020-03-11 | Paper |
Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems
| 2020-01-20 | Paper |
Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
SIAM Journal on Optimization | 2019-11-08 | Paper |
Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
Mathematical Programming. Series A. Series B | 2019-06-26 | Paper |
\(\ell_0\)-minimization methods for image restoration problems based on wavelet frames
Inverse Problems | 2019-06-21 | Paper |
\(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
Computational Optimization and Applications | 2018-02-01 | Paper |
A randomized nonmonotone block proximal gradient method for a class of structured nonlinear programming
SIAM Journal on Numerical Analysis | 2017-12-08 | Paper |
Randomized block proximal damped Newton method for composite self-concordant minimization
SIAM Journal on Optimization | 2017-09-07 | Paper |
An augmented Lagrangian method for non-Lipschitz nonconvex programming
SIAM Journal on Numerical Analysis | 2017-01-30 | Paper |
Penalty methods for a class of non-Lipschitz optimization problems
SIAM Journal on Optimization | 2016-07-21 | Paper |
An efficient optimization approach for a cardinality-constrained index tracking problem
Optimization Methods & Software | 2016-06-29 | Paper |
Sparse Recovery via Partial Regularization: Models, Theory and Algorithms
| 2015-11-23 | Paper |
An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
SIAM Journal on Optimization | 2015-11-18 | Paper |
Penalty decomposition methods for rank minimization
Optimization Methods & Software | 2015-09-04 | Paper |
On the complexity analysis of randomized block-coordinate descent methods
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
A proximal gradient method for ensemble density functional theory
SIAM Journal on Scientific Computing | 2015-08-17 | Paper |
Fused multiple graphical lasso
SIAM Journal on Optimization | 2015-06-11 | Paper |
Orthogonal rank-one matrix pursuit for low rank matrix completion
SIAM Journal on Scientific Computing | 2015-05-21 | Paper |
Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
Computing optimal experimental designs via interior point method
SIAM Journal on Matrix Analysis and Applications | 2014-04-30 | Paper |
Sparse Approximation via Penalty Decomposition Methods
SIAM Journal on Optimization | 2014-04-09 | Paper |
Primal-dual first-order methods for a class of cone programming
Optimization Methods & Software | 2013-12-19 | Paper |
$\ell _0$ Minimization for wavelet frame based image restoration
Mathematics of Computation | 2013-03-20 | Paper |
An alternating direction method for finding Dantzig selectors
Computational Statistics and Data Analysis | 2012-12-30 | Paper |
An augmented Lagrangian approach for sparse principal component analysis
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Optimal solutions for the closest-string problem via integer programming
INFORMS Journal on Computing | 2012-06-08 | Paper |
Minimizing Condition Number via Convex Programming
SIAM Journal on Matrix Analysis and Applications | 2012-03-21 | Paper |
Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
Robust portfolio selection based on a joint ellipsoidal uncertainty set
Optimization Methods & Software | 2011-10-12 | Paper |
Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
SIAM Journal on Matrix Analysis and Applications | 2010-11-04 | Paper |
Smooth Optimization Approach for Sparse Covariance Selection
SIAM Journal on Optimization | 2009-11-27 | Paper |
An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners
Optimization Methods & Software | 2009-02-18 | Paper |
Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
Optimization Methods & Software | 2008-01-21 | Paper |
Large-scale semidefinite programming via a saddle point mirror-prox algorithm
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
A modified nearly exact method for solving low-rank trust region subproblem
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
SIAM Journal on Optimization | 2006-05-30 | Paper |
Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
SIAM Journal on Optimization | 2005-09-16 | Paper |
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 Journal on Optimization | 2005-09-16 | Paper |
