output
20042026
most citedResearch Commentary on Recommendations with Side Information: A Survey and Research Directions

192 citations

Showing math.OCShow all

21 papers · 1 filter

math.OC2023★ 3 cited

Learning to Pivot as a Smart Expert

Tianhao Liu, Shanwen Pu, Dongdong Ge +1

Linear programming has been practically solved mainly by simplex and interior point methods. Compared with the weakly polynomial complexity obtained by the interior point methods,…

math.OC2023★ 1 cited

Homogeneous second-order descent framework: a fast alternative to Newton-type methods

Chang He, Yuntian Jiang, Chuwen Zhang +3

This paper proposes a homogeneous second-order descent framework (HSODF) for nonconvex and convex optimization based on the generalized homogeneous model (GHM). In comparison to th…

math.OC2022

A homogeneous second-order descent method for nonconvex optimization

Chuwen Zhang, Dongdong Ge, Chang He +4

In this paper, we introduce a Homogeneous Second-Order Descent Method (HSODM) using the homogenized quadratic approximation to the original function. The merit of homogenization is…

math.OC2022★ 18 cited

Variance-Reduced Stochastic Quasi-Newton Methods for Decentralized Learning: Part I

Jiaojiao Zhang, Huikang Liu, Anthony Man-Cho So +1

In this work, we investigate stochastic quasi-Newton methods for minimizing a finite sum of cost functions over a decentralized network. In Part I, we develop a general algorithmic…

math.OC2021

Optimal Partition for Multi-Type Queueing System

Shengyu Cao, Simai He, Zizhuo Wang +1

We study an optimal server partition and customer assignment problem for an uncapacitated FCFS queueing system with heterogeneous types of customers. Each type of customers is asso…

math.OC2021★ 2 cited

Graph-Based Equilibrium Metrics for Dynamic Supply-Demand Systems with Applications to Ride-sourcing Platforms

Fan Zhou, Shikai Luo, Xiaohu Qie +2

How to dynamically measure the local-to-global spatio-temporal coherence between demand and supply networks is a fundamental task for ride-sourcing platforms, such as DiDi. Such co…

math.OC2019★ 4 cited

Efficiency of Coordinate Descent Methods For Structured Nonconvex Optimization

Qi Deng, Chenghao Lan

Novel coordinate descent (CD) methods are proposed for minimizing nonconvex functions consisting of three terms: (i) a continuously differentiable term, (ii) a simple convex term,…

math.OC2019★ 6 cited

Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem

Dongdong Ge, Haoyue Wang, Zikai Xiong +1

Computing the Wasserstein barycenter of a set of probability measures under the optimal transport metric can quickly become prohibitive for traditional second-order algorithms, suc…

math.OC2018★ 2 cited

A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization

Bo Jiang, Tianyi Lin, Shuzhong Zhang

In this paper, we propose a unified two-phase scheme to accelerate any high-order regularized tensor approximation approach on the smooth part of a composite convex optimization mo…

math.OC2018★ 8 cited

On decompositions and approximations of conjugate partial-symmetric complex tensors

Taoran Fu, Bo Jiang, Zhening Li

Conjugate partial-symmetric (CPS) tensors are the high-order generalization of Hermitian matrices. As the role played by Hermitian matrices in matrix theory and quadratic optimizat…

math.OC2018★ 4 cited

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

Xi Chen, Bo Jiang, Tianyi Lin +1

In this paper, we consider an unconstrained optimization model where the objective is a sum of a large number of possibly nonconvex functions, though overall the objective is assum…

math.OC2017★ 8 cited

A Unified Scheme to Accelerate Adaptive Cubic Regularization and Gradient Methods for Convex Optimization

Bo Jiang, Tianyi Lin, Shuzhong Zhang

In this paper we propose a unified two-phase scheme for convex optimization to accelerate: (1) the adaptive cubic regularization methods with exact/inexact Hessian matrices, and (2…

math.OC2017★ 3 cited

The discrete moment problem with nonconvex shape constraints

Xi Chen, Simai He, Bo Jiang +2

The discrete moment problem is a foundational problem in distribution-free robust optimization, where the goal is to find a worst-case distribution that satisfies a given set of mo…

math.OC2016★ 22 cited

Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis

Bo Jiang, Tianyi Lin, Shiqian Ma +1

Nonconvex and nonsmooth optimization problems are frequently encountered in much of statistics, business, science and engineering, but they are not yet widely recognized as a techn…

math.OC2016★ 3 cited

Tensor and Its Tucker Core: the Invariance Relationships

Bo Jiang, Fan Yang, Shuzhong Zhang

In [13], Hillar and Lim famously demonstrated that "multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard". Despite many re…

math.OC2015★ 4 cited

Auxiliary Problem Principle of augmented Lagrangian with Varying Core Functions for Large-Scale Structured Convex Problems

Lei Zhao, Daoli Zhu, Bo Jiang

The auxiliary problem principle of augmented Lagrangian (APP-AL), proposed by Cohen and Zhu (1984), aims to find the solution of a constrained optimization problem through a sequen…

math.OC2015

Dynamic Programming Principle and Associated Hamilton-Jacobi-Bellman Equation for Stochastic Recursive Control Problem with Non-Lipschitz Aggregator

Jiangyan Pu, Qi Zhang

In this work we study the stochastic recursive control problem, in which the aggregator (or called generator) of the backward stochastic differential equation describing the runnin…

math.OC2015

Low-M-Rank Tensor Completion and Robust Tensor PCA

Bo Jiang, Shiqian Ma, Shuzhong Zhang

In this paper, we propose a new approach to solve low-rank tensor completion and robust tensor PCA. Our approach is based on some novel notion of (even-order) tensor ranks, to be c…

math.OC2015★ 1 cited

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

Bo Jiang, Zhening Li, Shuzhong Zhang

In this paper we study multivariate polynomial functions in complex variables and the corresponding associated symmetric tensor representations. The focus is on finding conditions…

math.OC2015★ 13 cited

Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions

Yichen Chen, Dongdong Ge, Mengdi Wang +3

Consider the regularized sparse minimization problem, which involves empirical sums of loss functions for data points (each of dimension ) and a nonconvex sparsity penalty.…

math.OC2012★ 1 cited

Tensor Principal Component Analysis via Convex Optimization

Bo Jiang, Shiqian Ma, Shuzhong Zhang

This paper is concerned with the computation of the principal components for a general tensor, known as the tensor principal component analysis (PCA) problem. We show that the gene…