Select Publications
Preprints
2024, Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs, http://dx.doi.org/10.48550/arxiv.2402.07064
,2022, A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems, http://dx.doi.org/10.48550/arxiv.2208.12432
,2021, Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems, http://dx.doi.org/10.48550/arxiv.2112.14404
,2021, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, http://dx.doi.org/10.48550/arxiv.2106.08584
,2020, Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems, http://dx.doi.org/10.48550/arxiv.2011.09782
,2020, Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semidefinite Programs, http://dx.doi.org/10.48550/arxiv.2007.07599
,2020, Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs, http://dx.doi.org/10.48550/arxiv.2003.04124
,2020, Exact Conic Programming Reformulations of Two-Stage Adjustable Robust Linear Programs with New Quadratic Decision Rules, http://dx.doi.org/10.48550/arxiv.2002.05223
,2019, Kurdyka-Łojasiewicz exponent via inf-projection, http://dx.doi.org/10.48550/arxiv.1902.03635
,2018, On the Q-linear convergence of forward-backward splitting method and uniqueness of optimal solution to Lasso, http://dx.doi.org/10.48550/arxiv.1806.06333
,2017, A Bounded Degree Lasserre Hierarchy with SOCP Relaxations for Global Polynomial Optimization and Applications, http://dx.doi.org/10.48550/arxiv.1710.06598
,2017, Extended Trust-Region Problems with One or Two Balls: Exact Copositive and Lagrangian Relaxations, http://dx.doi.org/10.48550/arxiv.1702.08113
,2016, Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods, http://dx.doi.org/10.48550/arxiv.1602.02915
,2015, Convergence rate analysis for averaged fixed point iterations in the presence of Hölder regularity, http://dx.doi.org/10.48550/arxiv.1510.06823
,2015, Error Bounds for Parametric Polynomial Systems with Applications to Higher-Order Stability Analysis and Convergence Rates, http://dx.doi.org/10.48550/arxiv.1509.03742
,2015, Peaceman-Rachford splitting for a class of nonconvex optimization problems, http://dx.doi.org/10.48550/arxiv.1507.00887
,2014, Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems, http://dx.doi.org/10.48550/arxiv.1409.8444
,2014, Global convergence of splitting methods for nonconvex composite optimization, http://dx.doi.org/10.48550/arxiv.1407.0753
,2013, Robust SOS-Convex Polynomial Programs: Exact SDP Relaxations, http://dx.doi.org/10.48550/arxiv.1307.5386
,2013, Analysis of the convergence rate for the cyclic projection algorithm applied to basic semi-algebraic convex sets, http://dx.doi.org/10.48550/arxiv.1304.7965
,