Shuzhong Zhang

SIAM J. Matrix Anal. Appl., March, 2024

A Gradient Complexity Analysis for Minimizing the Sum of Strongly Convex Functions with Varying Condition Numbers.

[BibT_eX]

[DOI]

Nuozhou Wang

SIAM J. Optim., 2024

2023

Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality.

[BibT_eX]

[DOI]

Ioannis C. Tsaknakis

Mingyi Hong

SIAM J. Optim., December, 2023

Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems.

[BibT_eX]

[DOI]

SIAM J. Optim., June, 2023

Linearly-Convergent FISTA Variant for Composite Optimization with Duality.

[BibT_eX]

[DOI]

Casey Garner

J. Sci. Comput., February, 2023

A Unified Analysis for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions.

[BibT_eX]

[DOI]

Daoli Zhu

Lei Zhao

CoRR, 2023

An Augmented Lagrangian Approach to Conically Constrained Non-monotone Variational Inequality Problems.

[BibT_eX]

[DOI]

Lei Zhao

Daoli Zhu

CoRR, 2023

2022

New First-Order Algorithms for Stochastic Variational Inequalities.

[BibT_eX]

[DOI]

Kevin Huang

SIAM J. Optim., December, 2022

Adaptive Stochastic Variance Reduction for Subsampled Newton Method with Cubic Regularization.

[BibT_eX]

[DOI]

Lin Xiao

INFORMS J. Optim., January, 2022

On lower iteration complexity bounds for the convex concave saddle point problems.

[BibT_eX]

[DOI]

Mingyi Hong

Math. Program., 2022

Cubic Regularized Newton Method for the Saddle Point Models: A Global and Local Convergence Analysis.

[BibT_eX]

[DOI]

Kevin Huang

J. Sci. Comput., 2022

Accelerating Adaptive Cubic Regularization of Newton's Method via Random Sampling.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2022

Cubic-Regularized Newton for Spectral Constrained Matrix Optimization and its Application to Fairness.

[BibT_eX]

[DOI]

Casey Garner

Gilad Lerman

CoRR, 2022

2021

Distributionally robust profit opportunities.

[BibT_eX]

[DOI]

Derek Singh

Oper. Res. Lett., 2021

Correction to: Robust Arbitrage Conditions for Financial Markets.

[BibT_eX]

[DOI]

Derek Singh

Oper. Res. Forum, 2021

Robust Arbitrage Conditions for Financial Markets.

[BibT_eX]

[DOI]

Derek Singh

Oper. Res. Forum, 2021

An ADMM-based interior-point method for large-scale linear programming.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2021

An Optimal High-Order Tensor Method for Convex Optimization.

[BibT_eX]

[DOI]

Haoyue Wang

Math. Oper. Res., 2021

Generalization Bounds for Stochastic Saddle Point Problems.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2020

Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis.

[BibT_eX]

[DOI]

Math. Program., 2020

Binary Random Projections with Controllable Sparsity Patterns.

[BibT_eX]

[DOI]

Wenye Li

CoRR, 2020

2019

Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

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

[BibT_eX]

[DOI]

Jianze Li

CoRR, 2019

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2019

Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives.

[BibT_eX]

[DOI]

Alexander V. Gasnikov

Pavel E. Dvurechensky

Eduard Gorbunov

Evgeniya A. Vorontsova

Proceedings of the Conference on Learning Theory, 2019

2018

A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2018

Low-M-Rank Tensor Completion and Robust Tensor PCA.

[BibT_eX]

[DOI]

IEEE J. Sel. Top. Signal Process., 2018

Global Convergence of Unmodified 3-Block ADMM for a Class of Convex Minimization Problems.

[BibT_eX]

[DOI]

J. Sci. Comput., 2018

On the Information-Adaptive Variants of the ADMM: An Iteration Complexity Perspective.

[BibT_eX]

[DOI]

Xiang Gao

J. Sci. Comput., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization.

[BibT_eX]

[DOI]

Yangyang Xu

Comput. Optim. Appl., 2018

Online Learning with Non-Convex Losses and Non-Stationary Regret.

[BibT_eX]

[DOI]

Xiand Gao

Xiaobo Li

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

On New Classes of Nonnegative Symmetric Tensors.

[BibT_eX]

[DOI]

SIAM J. Optim., 2017

Tensor and its tucker core: The invariance relationships.

[BibT_eX]

[DOI]

Fan Yang

Numer. Linear Algebra Appl., 2017

An Extragradient-Based Alternating Direction Method for Convex Minimization.

[BibT_eX]

[DOI]

Found. Comput. Math., 2017

On Cones of Nonnegative Quartic Forms.

[BibT_eX]

[DOI]

Found. Comput. Math., 2017

2016

Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2016

Local Linear Convergence of ISTA and FISTA on the LASSO Problem.

[BibT_eX]

[DOI]

Shaozhe Tao

Daniel Boley

SIAM J. Optim., 2016

A smoothing SQP framework for a class of composite Lq minimization over polyhedron.

[BibT_eX]

[DOI]

Math. Program., 2016

Iteration Complexity Analysis of Multi-block ADMM for a Family of Convex Minimization Without Strong Convexity.

[BibT_eX]

[DOI]

J. Sci. Comput., 2016

Tensor models: solution methods and applications.

[BibT_eX]

[DOI]

Proceedings of the Big Data over Networks, 2016

2015

On the Global Linear Convergence of the ADMM with MultiBlock Variables.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

On Convergence of the Maximum Block Improvement Method.

[BibT_eX]

[DOI]

André Uschmajew

SIAM J. Optim., 2015

Tensor principal component analysis via convex optimization.

[BibT_eX]

[DOI]

Math. Program., 2015

Inhomogeneous polynomial optimization over a convex set: An approximation approach.

[BibT_eX]

[DOI]

Math. Comput., 2015

On optimal low rank Tucker approximation for tensors: the case for an adjustable core size.

[BibT_eX]

[DOI]

Bilian Chen

J. Glob. Optim., 2015

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

[BibT_eX]

[DOI]

BioData Min., 2015

Convergence of Common Proximal Methods for L1-Regularized Least Squares.

[BibT_eX]

[DOI]

Shaozhe Tao

Daniel Boley

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

A Network Airline Revenue Management Framework Based on Decomposition by Origins and Destinations.

[BibT_eX]

[DOI]

S. Ilker Birbil

Transp. Sci., 2014

Moments Tensors, Hilbert's Identity, and k-wise Uncorrelated Random Variables.

[BibT_eX]

[DOI]

Math. Oper. Res., 2014

Probability Bounds for Polynomial Functions in Random Variables.

[BibT_eX]

[DOI]

Math. Oper. Res., 2014

On distributional robust probability functions and their computations.

[BibT_eX]

[DOI]

Man Hong Wong

Eur. J. Oper. Res., 2014

Approximation methods for complex polynomial optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2014

2013

Lorentz-Positive Maps and Quadratic Matrix Inequalities With Applications to Robust MISO Transmit Beamforming.

[BibT_eX]

[DOI]

Daniel P. Palomar

IEEE Trans. Signal Process., 2013

Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2013

Sparse solutions to random standard quadratic optimization problems.

[BibT_eX]

[DOI]

Xin Chen

Jiming Peng

Math. Program., 2013

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

[BibT_eX]

[DOI]

Xiaoling Sun

Duan Li

J. Glob. Optim., 2013

On a generalized Cournot oligopolistic competition game.

[BibT_eX]

[DOI]

Xiaoguo Wang

J. Glob. Optim., 2013

No-boundary thinking in bioinformatics research.

[BibT_eX]

[DOI]

BioData Min., 2013

2012

Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2012

Maximum Block Improvement and Polynomial Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2012

Polymatroid Optimization, Submodularity, and Joint Replenishment Games.

[BibT_eX]

[DOI]

Jiawei Zhang

Oper. Res., 2012

A Unified Adaptive Co-identification Framework for High-D Expression Data.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition in Bioinformatics, 2012

A cognitive approach for ambiguity function shaping.

[BibT_eX]

[DOI]

Proceedings of the IEEE 7th Sensor Array and Multichannel Signal Processing Workshop, 2012

Lorentz-positive mapswith applications to robust MISO downlink beamforming.

[BibT_eX]

[DOI]

Daniel P. Palomar

Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

2011

Design of Radar Receive Filters Optimized According to Lp-Norm Based Criteria.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2011

Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2011

Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2011

New results on Hermitian matrix rank-one decomposition.

[BibT_eX]

[DOI]

Math. Program., 2011

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

[BibT_eX]

[DOI]

Li Chen

Oper. Res., 2011

A New Framework for Co-clustering of Gene Expression Data.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition in Bioinformatics, 2011

Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2011

Radar code design with a Peak to average power Ratio constraint: A randomized approximate approach.

[BibT_eX]

[DOI]

Proceedings of the 19th European Signal Processing Conference, 2011

2010

Code design for radar STAP via optimization theory.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2010

Semidefinite Relaxation of Quadratic Optimization Problems.

[BibT_eX]

[DOI]

IEEE Signal Process. Mag., 2010

A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints.

[BibT_eX]

[DOI]

SIAM J. Optim., 2010

Approximation algorithms for homogeneous polynomial optimization with quadratic constraints.

[BibT_eX]

[DOI]

Math. Program., 2010

Bounding Probability of Small Deviation: A Fourth Moment Approach.

[BibT_eX]

[DOI]

Jiawei Zhang

Math. Oper. Res., 2010

Semidefinite programming, matrix decomposition, and radar code design.

[BibT_eX]

Antonio De Maio

Proceedings of the Convex Optimization in Signal Processing and Communications., 2010

2009

Adaptive Detection and Estimation in the Presence of Useful Signal and Interference Mismatches.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2009

Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2009

Duality gap estimation and polynomial time approximation for optimal spectrum management.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2009

Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition.

[BibT_eX]

[DOI]

SIAM J. Optim., 2009

Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm.

[BibT_eX]

[DOI]

Xiaoqing Wang

SIAM J. Control. Optim., 2009

The Role of Robust Optimization in Single-Leg Airline Revenue Management.

[BibT_eX]

[DOI]

S. Ilker Birbil

Manag. Sci., 2009

2008

Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2008

Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2008

Approximation algorithm for facility location with service installation costs.

[BibT_eX]

[DOI]

Dachuan Xu

Oper. Res. Lett., 2008

A D{\mathsf{D}}-induced duality and its applications.

[BibT_eX]

[DOI]

Jan Brinkhuis

Math. Program., 2008

On the Low Rank Solutions for Linear Matrix Inequalities.

[BibT_eX]

[DOI]

Math. Oper. Res., 2008

Dynamic Spectrum Management: Complexity and Duality.

[BibT_eX]

[DOI]

IEEE J. Sel. Top. Signal Process., 2008

Robust portfolio selection based on a multi-stage scenario tree.

[BibT_eX]

[DOI]

Ruijun Shen

Eur. J. Oper. Res., 2008

2007

Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints.

[BibT_eX]

[DOI]

Nicholas D. Sidiropoulos

Paul Tseng

SIAM J. Optim., 2007

Foreword: Special issue on large-scale nonlinear and semidefinite programming.

[BibT_eX]

[DOI]

Math. Program., 2007

Complex Matrix Decomposition and Quadratic Programming.

[BibT_eX]

[DOI]

Math. Oper. Res., 2007

2006

Complex Quadratic Optimization and Semidefinite Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

On implementation of a self-dual embedding method for convex programming.

[BibT_eX]

[DOI]

Johnny Tak Wai Cheng

Optim. Methods Softw., 2006

Tracking a Financial Benchmark Using a Few Assets.

[BibT_eX]

[DOI]

Oper. Res., 2006

2005

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

[BibT_eX]

[DOI]

SIAM J. Optim., 2005

Recursive approximation of the high dimensional max function.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming.

[BibT_eX]

[DOI]

Arjan Berkelaar

Roy Kouwenberg

Math. Program., 2005

Optimal linear decentralized estimation in a bandwidth constrained sensor network.

[BibT_eX]

[DOI]

Georgios B. Giannakis

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Stochastic Linear-Quadratic Control via Primal-Dual Semidefinite Programming.

[BibT_eX]

[DOI]

SIAM Rev., 2004

Multivariate Nonnegative Quadratic Mappings.

[BibT_eX]

[DOI]

SIAM J. Optim., 2004

A New Self-Dual Embedding Method for Convex Programming.

[BibT_eX]

[DOI]

J. Glob. Optim., 2004

2003

New Results on Quadratic Minimization.

[BibT_eX]

[DOI]

Yinyu Ye

SIAM J. Optim., 2003

On Cones of Nonnegative Quadratic Functions.

[BibT_eX]

[DOI]

Math. Oper. Res., 2003

2002

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

[BibT_eX]

[DOI]

Oper. Res., 2002

2001

A primal-dual semi-definite programming approach to linear quadratic control.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2001

Stochastic Linear-Quadratic Control via Semidefinite Programming.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2001

On sensitivity of central solutions in semidefinite programming.

[BibT_eX]

[DOI]

Math. Program., 2001

On a Profit Maximizing Location Model.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2001

2000

Global Error Bounds for Convex Conic Problems.

[BibT_eX]

[DOI]

SIAM J. Optim., 2000

Quadratic maximization and semidefinite relaxation.

[BibT_eX]

[DOI]

Math. Program., 2000

On weighted centers for semidefinite programming.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

1999

New variants of finite criss-cross pivot algorithms for linear programming.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

On Extensions of the Frank-Wolfe Theorems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 1999

Two Simple Algorithms for bin Covering.

[BibT_eX]

[DOI]

Acta Cybern., 1999

1998

Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 1998

On the long-step path-following method for semidefinite programming.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1998

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

[BibT_eX]

[DOI]

Jack A. A. van der Veen

Gerhard J. Woeginger

Math. Program., 1998

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

[BibT_eX]

[DOI]

Math. Program., 1998

1997

On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming.

[BibT_eX]

[DOI]

Math. Oper. Res., 1997

1996

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

[BibT_eX]

[DOI]

Math. Program., 1996

A new algorithm for generalized fractional programs.

[BibT_eX]

[DOI]

Math. Program., 1996

Using duality to solve generalized fractional programming problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 1996

Low-complexity algorithms for sequencing jobs with a fixed number of job-classes.

[BibT_eX]

[DOI]

Jack A. A. van der Veen

Comput. Oper. Res., 1996

New complexity results for the Iri-Imai method.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1996

1994

A deep cut ellipsoid algorithm for convex programming: Theory and applications.

[BibT_eX]

[DOI]

Math. Program., 1994

Improved Algorithms for Machine Allocation in Manufacturing Systems.

[BibT_eX]

[DOI]

Oper. Res., 1994

1993

A note on a stochastic location problem.

[BibT_eX]

[DOI]

Martine Labbé

Oper. Res. Lett., 1993

Pivot rules for linear programming: A survey on recent theoretical developments.

[BibT_eX]

[DOI]

Tamás Terlaky