activity
20202025
most citedDifference of convex algorithms for bilevel programs with applications in hyperparameter selection

3 citations · 6 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2025

On second-order weak sharp minima of general nonconvex set-constrained optimization problems

Xiaoxiao Ma, Wei Ouyang, Jane Ye +1

This paper explores local second-order weak sharp minima for a broad class of nonconvex optimization problems. We propose novel second-order optimality conditions formulated throug…

math.OC2023

Directional derivative of the value function for parametric set-constrained optimization problems

Kuang Bai, Jane Ye

This paper is concerned with the directional derivative of the value function for a very general set-constrained optimization problem under perturbation. Under reasonable assumptio…

math.OC2022★ 1 cited

Relaxed constant positive linear dependence constraint qualification for disjunctive programs

Mengwei Xu, Jane J. Ye

The disjunctive system is a system involving a disjunctive set which is the union of finitely many polyhedral convex sets. In this paper, we introduce a notion of the relaxed const…

math.OC2021★ 3 cited

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…

math.OC2020★ 2 cited

Optimality Conditions and Exact Penalty for Mathematical Programs with Switching Constraints

Yan-Chao Liang, Jane J. Ye

In this paper, we give an overview on optimality conditions and exact penalization for the mathematical program with switching constraints (MPSC). MPSC is a new class of optimizati…