3 citations · 5 across the 8 of their papers we have counts for
8 papers
Optimization with Parametric Variational Inequality Constraints on a Moving Set Based on a Smoothing Method
Xiaojun Chen, Jin Zhang, Yixuan Zhang
This paper focuses on optimization problems constrained by Parametric Variational Inequalities (PVI) defined on a moving set. Unlike most existing works on mathematical programs wi…
Calm local optimality for nonconvex-nonconcave minimax problems
Xiaoxiao Ma, Wei Yao, Jane J. Ye +1
Nonconvex-nonconcave minimax problems have found numerous applications in various fields including machine learning. However, questions remain about what is a good surrogate for lo…
Sensitivity analysis of the maximal value function with applications in nonconvex minimax programs
L. Guo, J. J. Ye, J. Zhang
In this paper, we perform sensitivity analysis for the maximal value function which is the optimal value function for a parametric maximization problem. Our aim is to study various…
A novel approach for bilevel programs based on Wolfe duality
Yuwei Li, Gui-Hua Lin, Jin Zhang +1
This paper considers a bilevel program, which has many applications in practice. To develop effective numerical algorithms, it is generally necessary to transform the bilevel progr…
Combined approach with second-order optimality conditions for bilevel programming problems
Xiaoxiao Ma, Wei Yao, Jane J. Ye +1
In this paper, we propose a combined approach with second-order optimality conditions of the lower level problem to study constraint qualifications and optimality conditions for bi…
Generic property of the partial calmness condition for bilevel programming problems
Rongzhu Ke, Wei Yao, Jane J. Ye +1
The partial calmness for the bilevel programming problem (BLPP) is an important condition which ensures that a local optimal solution of BLPP is a local optimal solution of a parti…
Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
Jane J. Ye, Xiaoming Yuan, Shangzhi Zeng +1
In this paper, we present difference of convex algorithms for solving bilevel programs in which the upper level objective functions are difference of convex functions, and the lowe…
Directional quasi/pseudo-normality as sufficient conditions for metric subregularity
Kuang Bai, Jane Ye, Jin Zhang
In this paper we study sufficient conditions for metric subregularity of a set-valued map which is the sum of a single-valued continuous map and a locally closed subset. First we d…