Shuzhong Zhang

According to our database1, Shuzhong Zhang authored at least 118 papers between 1990 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 




Distributionally robust profit opportunities.
Oper. Res. Lett., 2021

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

Generalization Bounds for Stochastic Saddle Point Problems.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization.
SIAM J. Optim., 2020

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

Binary Random Projections with Controllable Sparsity Patterns.
CoRR, 2020

Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection.
SIAM J. Optim., 2019

Polar decomposition based algorithms on the product of Stiefel manifolds with applications in tensor approximation.
CoRR, 2019

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

Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives.
Proceedings of the Conference on Learning Theory, 2019

An Optimal High-Order Tensor Method for Convex Optimization.
Proceedings of the Conference on Learning Theory, 2019

A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection.
SIAM J. Sci. Comput., 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

On the Information-Adaptive Variants of the ADMM: An Iteration Complexity Perspective.
J. Sci. Comput., 2018

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

Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization.
Comput. Optim. Appl., 2018

Online Learning with Non-Convex Losses and Non-Stationary Regret.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

On New Classes of Nonnegative Symmetric Tensors.
SIAM J. Optim., 2017

Tensor and its tucker core: The invariance relationships.
Numer. Linear Algebra Appl., 2017

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

On Cones of Nonnegative Quartic Forms.
Found. Comput. Math., 2017

Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations.
SIAM J. Matrix Anal. Appl., 2016

Local Linear Convergence of ISTA and FISTA on the LASSO Problem.
SIAM J. Optim., 2016

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

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

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

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

On Convergence of the Maximum Block Improvement Method.
SIAM J. Optim., 2015

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

Inhomogeneous polynomial optimization over a convex set: An approximation approach.
Math. Comput., 2015

On optimal low rank Tucker approximation for tensors: the case for an adjustable core size.
J. Glob. Optim., 2015

Big data - a 21st century science Maginot Line? No-boundary thinking: shifting from the big data paradigm.
BioData Min., 2015

Convergence of Common Proximal Methods for L1-Regularized Least Squares.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

A Network Airline Revenue Management Framework Based on Decomposition by Origins and Destinations.
Transp. Sci., 2014

Moments Tensors, Hilbert's Identity, and k-wise Uncorrelated Random Variables.
Math. Oper. Res., 2014

Probability Bounds for Polynomial Functions in Random Variables.
Math. Oper. Res., 2014

On distributional robust probability functions and their computations.
Eur. J. Oper. Res., 2014

Approximation methods for complex polynomial optimization.
Comput. Optim. Appl., 2014

Lorentz-Positive Maps and Quadratic Matrix Inequalities With Applications to Robust MISO Transmit Beamforming.
IEEE Trans. Signal Process., 2013

Sparse solutions to random standard quadratic optimization problems.
Math. Program., 2013

Preface: Special issue of Journal of Global Optimization for the 8th international conference on optimization: techniques and applications.
J. Glob. Optim., 2013

On a generalized Cournot oligopolistic competition game.
J. Glob. Optim., 2013

No-boundary thinking in bioinformatics research.
BioData Min., 2013

Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios.
IEEE Trans. Signal Process., 2012

Maximum Block Improvement and Polynomial Optimization.
SIAM J. Optim., 2012

Polymatroid Optimization, Submodularity, and Joint Replenishment Games.
Oper. Res., 2012

A Unified Adaptive Co-identification Framework for High-D Expression Data.
Proceedings of the Pattern Recognition in Bioinformatics, 2012

Lorentz-positive mapswith applications to robust MISO downlink beamforming.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

Design of Radar Receive Filters Optimized According to L<sub>p</sub>-Norm Based Criteria.
IEEE Trans. Signal Process., 2011

Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint.
IEEE Trans. Signal Process., 2011

Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection.
IEEE Trans. Signal Process., 2011

New results on Hermitian matrix rank-one decomposition.
Math. Program., 2011

Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection.
Oper. Res., 2011

A New Framework for Co-clustering of Gene Expression Data.
Proceedings of the Pattern Recognition in Bioinformatics, 2011

Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information.
Proceedings of the IEEE International Conference on Acoustics, 2011

Radar code design with a Peak to average power Ratio constraint: A randomized approximate approach.
Proceedings of the 19th European Signal Processing Conference, 2011

Code design for radar STAP via optimization theory.
IEEE Trans. Signal Process., 2010

Semidefinite Relaxation of Quadratic Optimization Problems.
IEEE Signal Process. Mag., 2010

A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints.
SIAM J. Optim., 2010

Approximation algorithms for homogeneous polynomial optimization with quadratic constraints.
Math. Program., 2010

Bounding Probability of Small Deviation: A Fourth Moment Approach.
Math. Oper. Res., 2010

Semidefinite programming, matrix decomposition, and radar code design.
Proceedings of the Convex Optimization in Signal Processing and Communications., 2010

Adaptive Detection and Estimation in the Presence of Useful Signal and Interference Mismatches.
IEEE Trans. Signal Process., 2009

Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint.
IEEE Trans. Signal Process., 2009

Duality gap estimation and polynomial time approximation for optimal spectrum management.
IEEE Trans. Signal Process., 2009

Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition.
SIAM J. Optim., 2009

Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm.
SIAM J. Control. Optim., 2009

The Role of Robust Optimization in Single-Leg Airline Revenue Management.
Manag. Sci., 2009

Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints.
IEEE Trans. Signal Process., 2008

Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization.
SIAM J. Optim., 2008

Approximation algorithm for facility location with service installation costs.
Oper. Res. Lett., 2008

A <i>D</i>{\mathsf{D}}-induced duality and its applications.
Math. Program., 2008

On the Low Rank Solutions for Linear Matrix Inequalities.
Math. Oper. Res., 2008

Dynamic Spectrum Management: Complexity and Duality.
IEEE J. Sel. Top. Signal Process., 2008

Robust portfolio selection based on a multi-stage scenario tree.
Eur. J. Oper. Res., 2008

Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints.
SIAM J. Optim., 2007

Foreword: Special issue on large-scale nonlinear and semidefinite programming.
Math. Program., 2007

Complex Matrix Decomposition and Quadratic Programming.
Math. Oper. Res., 2007

Complex Quadratic Optimization and Semidefinite Programming.
SIAM J. Optim., 2006

On implementation of a self-dual embedding method for convex programming.
Optim. Methods Softw., 2006

Tracking a Financial Benchmark Using a Few Assets.
Oper. Res., 2006

An O(\sqrtn L) Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP.
SIAM J. Optim., 2005

Recursive approximation of the high dimensional max function.
Oper. Res. Lett., 2005

A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming.
Math. Program., 2005

Optimal linear decentralized estimation in a bandwidth constrained sensor network.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Stochastic Linear-Quadratic Control via Primal-Dual Semidefinite Programming.
SIAM Rev., 2004

Multivariate Nonnegative Quadratic Mappings.
SIAM J. Optim., 2004

A New Self-Dual Embedding Method for Convex Programming.
J. Glob. Optim., 2004

New Results on Quadratic Minimization.
SIAM J. Optim., 2003

On Cones of Nonnegative Quadratic Functions.
Math. Oper. Res., 2003

A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming.
Oper. Res., 2002

A primal-dual semi-definite programming approach to linear quadratic control.
IEEE Trans. Autom. Control., 2001

Stochastic Linear-Quadratic Control via Semidefinite Programming.
SIAM J. Control. Optim., 2001

On sensitivity of central solutions in semidefinite programming.
Math. Program., 2001

On a Profit Maximizing Location Model.
Ann. Oper. Res., 2001

Global Error Bounds for Convex Conic Problems.
SIAM J. Optim., 2000

Quadratic maximization and semidefinite relaxation.
Math. Program., 2000

On weighted centers for semidefinite programming.
Eur. J. Oper. Res., 2000

New variants of finite criss-cross pivot algorithms for linear programming.
Eur. J. Oper. Res., 1999

On Extensions of the Frank-Wolfe Theorems.
Comput. Optim. Appl., 1999

Two Simple Algorithms for bin Covering.
Acta Cybern., 1999

Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming.
SIAM J. Optim., 1998

On the long-step path-following method for semidefinite programming.
Oper. Res. Lett., 1998

Sequencing jobs that require common resources on a single machine: A solvable case of the TSP.
Math. Program., 1998

An interior point method, based on rank-1 updates, for linear programming.
Math. Program., 1998

On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming.
Math. Oper. Res., 1997

An O(root(n)L) iteration bound primal-dual cone affine scaling algorithm for linear programming.
Math. Program., 1996

A new algorithm for generalized fractional programs.
Math. Program., 1996

Using duality to solve generalized fractional programming problems.
J. Glob. Optim., 1996

Low-complexity algorithms for sequencing jobs with a fixed number of job-classes.
Comput. Oper. Res., 1996

New complexity results for the Iri-Imai method.
Ann. Oper. Res., 1996

A deep cut ellipsoid algorithm for convex programming: Theory and applications.
Math. Program., 1994

Improved Algorithms for Machine Allocation in Manufacturing Systems.
Oper. Res., 1994

A note on a stochastic location problem.
Oper. Res. Lett., 1993

Pivot rules for linear programming: A survey on recent theoretical developments.
Ann. Oper. Res., 1993

Heuristic for the 0-1 Min-Knapsack Problem.
Acta Cybern., 1991

On the multidimensional vector bin packing.
Acta Cybern., 1990