6 citations · 22 across the 32 of their papers we have counts for
12 papers · 1 filter
Bilevel Models for Adversarial Learning and A Case Study
Yutong Zheng, Qingna Li
Adversarial learning has been attracting more and more attention thanks to the fast development of machine learning and artificial intelligence. However, due to the complicated str…
A Robust EDM Optimization Approach for 3D Single-Source Localization with Angle and Range Measurements
Mingyu Zhao, Qingna Li, Hou-Duo Qi
Accurate source localization in Multi-Platform Radar Networks (MPRNs) benefits from exploiting both range and angle measurements under robust estimation. In this paper, we propose…
On Constraint Qualifications for MPECs with Applications to Bilevel Hyperparameter Optimization for Machine Learning
Jiani Li, Qingna Li, Alain Zemkoho
Constraint qualifications for a Mathematical Program with Equilibrium Constraints (MPEC) are essential for analyzing stationarity properties and establishing convergence results. I…
Modified Block Newton Algorithm for -Regularized Optimization
Yuge Ye, Qingna Li
In this paper, we propose a globally convergent Newton type method to solve regularized sparse optimization problem. In fact, a line search strategy is applied to the Newt…
An Efficient Smoothing Damped Newton Method for Large-Scale Mathematical Programs with Equilibrium Constraints
Yixin Wang, Qingna Li, Liwei Zhang
Bilevel hyperparameter optimization has received growing attention thanks to the fast development of machine learning. Due to the tremendous size of data sets, the scale of bilevel…
Proximal Iterative Hard Thresholding Algorithm for Sparse Group -Regularized Optimization with Box Constraint
Yuge Ye, Qingna Li
This paper investigates a general class of problems in which a lower bounded smooth convex function incorporating and regularization is minimized over a box…
Subspace Newton's Method for -Regularized Optimization Problems with Box Constraint
Yuge Ye, Qingna Li
This paper investigates the box-constrained -regularized sparse optimization problem. We introduce the concept of a -stationary point and establish its connection to the…
Inexact Regularized Quasi-Newton Algorithm for Solving Monotone Variational Inequality Problems
Yuge Ye, Qingna Li, Deren Han
Newton's method has been an important approach for solving variational inequalities, quasi-Newton method is a good alternative choice to save computational cost. In this paper, we…
A Spectral Projected Gradient Method for Computational Protein Design problem
Yukai Zheng, Qingna Li
In this paper, we consider the computational protein design (CPD) problem, which is usually modeled as 0/1 programming and is extremely challenging due to its combinatorial propert…
A Matrix Optimization Method for Blind Extraction of External Equitable Partitions from Low Pass Graph Signals
Wenshun Teng, Qingna Li
Seeking the external equitable partitions (EEPs) of networks under unknown structures is an emerging problem in network analysis. The special structure of EEPs has found widespread…
Triangle Steepest Descent: A Geometry-Based Gradient Algorithm with Guaranteed R-Linear Convergence
Ya Shen, Qing-Na Li, Yu-Hong Dai
Gradient methods are among the simplest yet most widely used algorithms for unconstrained optimization. Motivated by a geometric property of the steepest descent (SD) method that c…
An Efficient Quadratic Penalty Method for a Class of Graph Clustering Problems
Wenshun Teng, Qingna Li
Community-based graph clustering is one of the most popular topics in the analysis of complex social networks. This type of clustering involves grouping vertices that are considere…