The following pages link to Shi-Qian Ma (Q888301):
Displayed 50 items.
- (Q304257) (redirect page) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- (Q334318) (redirect page) (← links)
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity (Q334319) (← links)
- Applications of gauge duality in robust principal component analysis and semidefinite programming (Q341322) (← links)
- Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
- Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
- An extragradient-based alternating direction method for convex minimization (Q525598) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
- On the sublinear convergence rate of multi-block ADMM (Q888303) (← links)
- A fast subspace method for image deblurring (Q1039709) (← links)
- Global convergence of unmodified 3-block ADMM for a class of convex minimization problems (Q1668709) (← links)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
- Accelerated linearized Bregman method (Q1945379) (← links)
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis (Q2205985) (← links)
- Robust principal component analysis using facial reduction (Q2218887) (← links)
- Tensor principal component analysis via convex optimization (Q2340337) (← links)
- Alternating proximal gradient method for convex minimization (Q2399191) (← links)
- Efficient algorithms for robust and stable principal component pursuit problems (Q2450901) (← links)
- Fast Multiple-Splitting Algorithms for Convex Optimization (Q2910883) (← links)
- An alternating direction method for total variation denoising (Q2943837) (← links)
- Penalty methods with stochastic approximation for stochastic nonlinear programming (Q2970100) (← links)
- (Q3001312) (← links)
- Projected Barzilai–Borwein method for large-scale nonnegative image restoration (Q3062535) (← links)
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
- A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem (Q3449576) (← links)
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization (Q3454490) (← links)
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers (Q3466914) (← links)
- Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization (Q4567042) (← links)
- Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">$L_{q}$</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach (Q4580676) (← links)
- Reduced-Rank Modeling for High-Dimensional Model-Based Clustering (Q4688183) (← links)
- Positive-Definite ℓ<sub>1</sub>-Penalized Estimation of Large Covariance Matrices (Q4904725) (← links)
- An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
- Robust Low-Rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method (Q5103542) (← links)
- Alternating direction method of multipliers for real and complex polynomial optimization models (Q5169464) (← links)
- On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming (Q5219732) (← links)
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection (Q5378251) (← links)
- On the Global Linear Convergence of the ADMM with MultiBlock Variables (Q5502240) (← links)
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization (Q5737735) (← links)
- Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning (Q5868728) (← links)
- Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities (Q6064044) (← links)
- Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization (Q6118343) (← links)
- Inertial primal-dual algorithms for structured convex optimization (Q6254537) (← links)
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization (Q6256939) (← links)
- Low-M-Rank Tensor Completion and Robust Tensor PCA (Q6258159) (← links)
- A Scalable Frank-Wolfe based Augmented Lagrangian Method for Linearly Constrained Composite Convex Programming (Q6263980) (← links)
- Vector Transport-Free SVRG with General Retraction for Riemannian Optimization: Complexity Analysis and Practical Implementation (Q6287092) (← links)
- Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method (Q6347272) (← links)
- Decentralized Bilevel Optimization (Q6401815) (← links)