output
20122026
most citedDeep Learning Face Representation by Joint Identification-Verification

1.8k citations

Showing math.OCShow all

51 papers · 1 filter

math.OC2026

A Sparse Corner-Difference MILP for Minimum Square Tiling

Zhuo Yu, Yuan Wang, Zhuo Liu

We study the problem of tiling an square with axis-aligned squares whose side lengths are integers strictly less than , with the objective of minimizing the number o…

math.OC2026

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization

Hanfeng Zeng, Wenqing Ouyang, Andre Milzarek

We propose a novel linesearch variant of the trust region normal map-based semismooth Newton method developed in [Ouyang and Milzarek, Math. Program. 212(1-2), 389--435 (2025)] for…

math.OC2024

Parallel Graver Basis Extraction for Nonlinear Integer Optimization

Wenbo Liu, Akang Wang, Wenguo Yang

The augmentation scheme provides a nontraditional approach to nonlinear integer programming by iteratively refining incumbent solutions along objective-improving directions from th…

math.OC2024★ 1 cited

Matrix Completion and Decomposition in Phase Bounded Cones

Ding Zhang, Axel Ringh, Li Qiu

The problem of matrix completion and decomposition in the cone of positive semidefinite (PSD) matrices is a well-understood problem, with many important applications in areas such…

math.OC2024

Proximal random reshuffling under local Lipschitz continuity

Cédric Josz, Lexiao Lai, Xiaopeng Li

We study proximal random reshuffling (PRR) for minimizing the sum of locally Lipschitz or locally smooth functions and a proper lower semicontinuous convex function without assumin…

math.OC2024

Non-convergence to global minimizers for Adam and stochastic gradient descent optimization and constructions of local minimizers in the training of artificial neural networks

Arnulf Jentzen, Adrian Riekert

Stochastic gradient descent (SGD) optimization methods such as the plain vanilla SGD method and the popular Adam optimizer are nowadays the method of choice in the training of arti…

math.OC2023★ 31 cited

Sample Robust Scheduling of Electricity-Gas Systems Under Wind Power Uncertainty

Rong-Peng Liu, Yunhe Hou, Yujia Li +3

This paper adopts a two-stage sample robust optimization (SRO) model to address the wind power penetrated unit commitment optimal energy flow (UC-OEF) problem for IEGSs. The two-st…

math.OC2023★ 3 cited

Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity

Xiao Li, Lei Zhao, Daoli Zhu +1

The subgradient method is one of the most fundamental algorithmic schemes for nonsmooth optimization. The existing complexity and convergence results for this method are mainly der…

math.OC2022★ 7 cited

Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum

Mengqi Hu, Yifei Lou, Bao Wang +3

This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of…

math.OC2022★ 2 cited

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction

Andre Milzarek, Fabian Schaipp, Michael Ulbrich

We develop an implementable stochastic proximal point (SPP) method for a class of weakly convex, composite optimization problems. The proposed stochastic proximal point algorithm i…

math.OC2021★ 14 cited

On the existence of global minima and convergence analyses for gradient descent methods in the training of deep neural networks

Arnulf Jentzen, Adrian Riekert

In this article we study fully-connected feedforward deep ReLU ANNs with an arbitrarily large number of hidden layers and we prove convergence of the risk of the GD optimization me…

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★ 1 cited

Optimal Gradient Tracking for Decentralized Optimization

Zhuoqing Song, Lei Shi, Shi Pu +1

In this paper, we focus on solving the decentralized optimization problem of minimizing the sum of objective functions over a multi-agent network. The agents are embedded in an…

math.OC2021★ 1 cited

Convergence of Random Reshuffling Under The Kurdyka-Łojasiewicz Inequality

Xiao Li, Andre Milzarek, Junwen Qiu

We study the random reshuffling (RR) method for smooth nonconvex optimization problems with a finite-sum structure. Though this method is widely utilized in practice such as the tr…

math.OC2021★ 2 cited

Provably Accelerated Decentralized Gradient Method Over Unbalanced Directed Graphs

Zhuoqing Song, Lei Shi, Shi Pu +1

We consider the decentralized optimization problem, where a network of agents aims to collaboratively minimize the average of their individual smooth and convex objective funct…

math.OC2021★ 1 cited

A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization

Wenqing Ouyang, Andre Milzarek

We propose a novel trust region method for solving a class of nonsmooth, nonconvex composite-type optimization problems. The approach embeds inexact semismooth Newton steps for fin…

math.OC2021★ 28 cited

Compressed Gradient Tracking for Decentralized Optimization Over General Directed Networks

Zhuoqing Song, Lei Shi, Shi Pu +1

In this paper, we propose two communication efficient decentralized optimization algorithms over a general directed multi-agent network. The first algorithm, termed Compressed Push…

math.OC2021★ 9 cited

A Communication-Efficient and Privacy-Aware Distributed Algorithm for Sparse PCA

Lei Wang, Xin Liu, Yin Zhang

Sparse principal component analysis (PCA) improves interpretability of the classic PCA by introducing sparsity into the dimension-reduction process. Optimization models for sparse…

math.OC2021

Approximating the Optimal Transport Plan via Particle-Evolving Method

Shu Liu, Haodong Sun, Hongyuan Zha

Optimal transport (OT) provides powerful tools for comparing probability measures in various types. The Wasserstein distance which arises naturally from the idea of OT is widely us…

math.OC2021★ 1 cited

Decentralized Non-Convex Learning with Linearly Coupled Constraints

Jiawei Zhang, Songyang Ge, Tsung-Hui Chang +1

Motivated by the need for decentralized learning, this paper aims at designing a distributed algorithm for solving nonconvex problems with general linear constraints over a multi-a…

math.OC2020★ 2 cited

Seeking Consensus on Subspaces in Federated Principal Component Analysis

Lei Wang, Xin Liu, Yin Zhang

In this paper, we develop an algorithm for federated principal component analysis (PCA) with emphases on both communication efficiency and data privacy. Generally speaking, federat…

math.OC2020★ 38 cited

Distributed Stochastic Consensus Optimization with Momentum for Nonconvex Nonsmooth Problems

Zhiguo Wang, Jiawei Zhang, Tsung-Hui Chang +2

While many distributed optimization algorithms have been proposed for solving smooth or convex problems over the networks, few of them can handle non-convex and non-smooth problems…

math.OC2020★ 18 cited

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems

Jiawei Zhang, Peijun Xiao, Ruoyu Sun +1

Nonconvex-concave min-max problem arises in many machine learning applications including minimizing a pointwise maximum of a set of nonconvex functions and robust adversarial train…

math.OC2020★ 12 cited

Scalable Deep Reinforcement Learning for Ride-Hailing

Jiekun Feng, Mark Gluzman, J. G. Dai

Ride-hailing services, such as Didi Chuxing, Lyft, and Uber, arrange thousands of cars to meet ride requests throughout the day. We consider a Markov decision process (MDP) model o…