Shiqian Ma

Orcid: 0000-0003-1967-1069

According to our database1, Shiqian Ma authored at least 84 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A New Inexact Proximal Linear Algorithm With Adaptive Stopping Criteria for Robust Phase Retrieval.
IEEE Trans. Signal Process., 2024

Decentralized and Equitable Optimal Transport.
CoRR, 2024

Problem-Parameter-Free Decentralized Nonconvex Stochastic Optimization.
CoRR, 2024

2023
Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities.
J. Glob. Optim., November, 2023

Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization.
Math. Oper. Res., May, 2023

MLfus: A real-time forecasting architecture for low communication costs in electricity IoT based on ensemble learning.
IET Commun., January, 2023

A Single-Loop Algorithm for Decentralized Bilevel Optimization.
CoRR, 2023

Zeroth-order Riemannian Averaging Stochastic Approximation Algorithms.
CoRR, 2023

Primal Extended Position Based Dynamics for Hyperelasticity.
Proceedings of the 16th ACM SIGGRAPH Conference on Motion, Interaction and Games, 2023

Decentralized Stochastic Bilevel Optimization with Improved per-Iteration Complexity.
Proceedings of the International Conference on Machine Learning, 2023

2022
Adaptive composite frequency control of power systems using reinforcement learning.
CAAI Trans. Intell. Technol., December, 2022

A Manifold Proximal Linear Method for Sparse Spectral Clustering with Application to Single-Cell RNA Sequencing Data Analysis.
INFORMS J. Optim., April, 2022

Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold.
J. Mach. Learn. Res., 2022

A Riemannian ADMM.
CoRR, 2022

Decentralized Stochastic Bilevel Optimization with Improved Per-Iteration Complexity.
CoRR, 2022

Federated Learning on Riemannian Manifolds.
CoRR, 2022

Efficiently Escaping Saddle Points in Bilevel Optimization.
CoRR, 2022

Day-ahead optimal dispatching of hybrid power system based on deep reinforcement learning.
Cogn. Comput. Syst., 2022

2021
Robust Low-Rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method.
IEEE Trans. Signal Process., 2021

Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning.
IEEE Trans. Signal Process., 2021

An ADMM-based interior-point method for large-scale linear programming.
Optim. Methods Softw., 2021

On the Convergence of Projected Alternating Maximization for Equitable and Optimal Transport.
CoRR, 2021

A Riemannian smoothing steepest descent method for non-Lipschitz optimization on submanifolds.
CoRR, 2021

Robust Speaker Extraction Network Based on Iterative Refined Adaptation.
Proceedings of the Interspeech 2021, 22nd Annual Conference of the International Speech Communication Association, Brno, Czechia, 30 August, 2021

Projection Robust Wasserstein Barycenters.
Proceedings of the 38th International Conference on Machine Learning, 2021

A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
An Alternating Manifold Proximal Gradient Method for Sparse Principal Component Analysis and Sparse Canonical Correlation Analysis.
INFORMS J. Optim., July, 2020

Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold.
SIAM J. Optim., 2020

Accelerated dual-averaging primal-dual method for composite convex minimization.
Optim. Methods Softw., 2020

Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis.
Math. Program., 2020

A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization.
Math. Oper. Res., 2020

Zeroth-order Optimization on Riemannian Manifolds.
CoRR, 2020

Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities.
CoRR, 2020

Generative Adversarial Network Based Acoustic Echo Cancellation.
Proceedings of the Interspeech 2020, 2020

Conv-TasSAN: Separative Adversarial Network Based on Conv-TasNet.
Proceedings of the Interspeech 2020, 2020

2019
A User-Oriented Pricing Design for Demand Response in Smart Grid.
Wirel. Commun. Mob. Comput., 2019

On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming.
Math. Oper. Res., 2019

An Alternating Manifold Proximal Gradient Method for Sparse PCA and Sparse CCA.
CoRR, 2019

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis.
Comput. Optim. Appl., 2019

Software-in-the-Loop Planning of Fast Charging Station based on GNN-Accelerated Ordinal Optimization.
Proceedings of the 2019 IEEE International Conference on Service Operations and Logistics, 2019

2018
ADMM for High-Dimensional Sparse Penalized Quantile Regression.
Technometrics, 2018

Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization.
IEEE Trans. Autom. Control., 2018

Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants.
Proc. IEEE, 2018

Low-M-Rank Tensor Completion and Robust Tensor PCA.
IEEE J. Sel. Top. Signal Process., 2018

Global Convergence of Unmodified 3-Block ADMM for a Class of Convex Minimization Problems.
J. Sci. Comput., 2018

A novel design framework for smart operating robot in power system.
IEEE CAA J. Autom. Sinica, 2018

Highly accurate model for prediction of lung nodule malignancy with CT scans.
CoRR, 2018

Stochastic Primal-Dual Method for Empirical Risk Minimization with O(1) Per-Iteration Complexity.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization.
SIAM J. Optim., 2017

Penalty methods with stochastic approximation for stochastic nonlinear programming.
Math. Comput., 2017

An Extragradient-Based Alternating Direction Method for Convex Minimization.
Found. Comput. Math., 2017

Geometric Descent Method for Convex Composite Minimization.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

GSOS: Gauss-Seidel Operator Splitting Algorithm for Multi-Term Nonsmooth Convex Composite Optimization.
Proceedings of the 34th International Conference on Machine Learning, 2017

Adaptive Proximal Average Approximation for Composite Convex Minimization.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
A smoothing SQP framework for a class of composite L<sub>q</sub> minimization over polyhedron.
Math. Program., 2016

Alternating Proximal Gradient Method for Convex Minimization.
J. Sci. Comput., 2016

Iteration Complexity Analysis of Multi-block ADMM for a Family of Convex Minimization Without Strong Convexity.
J. Sci. Comput., 2016

Geometric descent method for convex composite minimization.
CoRR, 2016

Barzilai-Borwein Step Size for Stochastic Gradient Descent.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Tensor models: solution methods and applications.
Proceedings of the Big Data over Networks, 2016

2015
Joint Power and Admission Control: Non-Convex L<sub>q</sub> Approximation and An Effective Polynomial Time Deflation Approach.
IEEE Trans. Signal Process., 2015

On the Global Linear Convergence of the ADMM with MultiBlock Variables.
SIAM J. Optim., 2015

A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem.
SIAM J. Optim., 2015

Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization.
SIAM J. Imaging Sci., 2015

An alternating direction method for total variation denoising.
Optim. Methods Softw., 2015

Tensor principal component analysis via convex optimization.
Math. Program., 2015

Sparse Subspace Clustering for Incomplete Images.
Proceedings of the 2015 IEEE International Conference on Computer Vision Workshop, 2015

Low-Rank Similarity Metric Learning in High Dimensions.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Efficient algorithms for robust and stable principal component pursuit problems.
Comput. Optim. Appl., 2014

A block coordinate descent method of multipliers: Convergence analysis and applications.
Proceedings of the IEEE International Conference on Acoustics, 2014

Doubly Regularized Portfolio with Risk Minimization.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection.
Neural Comput., 2013

Fast alternating linearization methods for minimizing the sum of two convex functions.
Math. Program., 2013

Accelerated Linearized Bregman Method.
J. Sci. Comput., 2013

Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers.
CoRR, 2013

Joint Power and Admission Control: Non-Convex Approximation and An Efficient Polynomial Time Deflation Approach.
CoRR, 2013

2012
Fast Multiple-Splitting Algorithms for Convex Optimization.
SIAM J. Optim., 2012

2011
Fixed point and Bregman iterative methods for matrix rank minimization.
Math. Program., 2011

Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization.
Found. Comput. Math., 2011

2010
Sparse Inverse Covariance Selection via Alternating Linearization Methods.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Semi-supervised sparse metric learning using alternating linearization optimization.
Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010

2009
A fast subspace method for image deblurring.
Appl. Math. Comput., 2009

Solving low-rank matrix completion problems efficiently.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
An efficient algorithm for compressed MR imaging using total variation and wavelets.
Proceedings of the 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 2008


  Loading...