On bilevel programs and minimax problems

dc.contributor.authorMa, Xiaoxiao
dc.contributor.supervisorYe, Jane J.
dc.date.accessioned2024-08-15T17:00:44Z
dc.date.available2024-08-15T17:00:44Z
dc.date.issued2024
dc.degree.departmentDepartment of Mathematics and Statistics
dc.degree.levelDoctor of Philosophy PhD
dc.description.abstractSecond-order optimality conditions usually offer more precise insights into local optimality compared to their first-order counterparts. Concurrently, there has been a growing prevalence of bilevel programs and minimax problems in recent years. In our research, we intricately explore second-order optimality conditions within the realm of bilevel programs and minimax problems. First, we provide a comprehensive exploration of second-order combined approaches for bilevel problems. Building on the well-known first-order combined approach, the research introduces novel techniques that incorporate lower-level second-order information to overcome the difficulty of the constraint qualification for bilevel problems. By characterizing lower-level optimal solutions using both first and second-order necessary optimality conditions, together with the value function constraint, we give some new single-level reformulations for bilevel problems for which the important partial calmness condition can be more likely to hold. We then focus on the introduction and analysis of calm local minimax points, which is an appropriate local notion for nonconvex-nonconcave nonsmooth minimax problems. We study the properties of calm local minimax points, establishing their strong connections with existing optimality concepts. We provide a comprehensive exploration of first-order and second-order sufficient and necessary optimality conditions for calm local minimax points.
dc.description.scholarlevelGraduate
dc.identifier.bibliographicCitationX.X. Ma, W. Yao, J.J. Ye and J. Zhang, Combined approach with second-order optimality conditions for bilevel programming problems, J. Convex Anal., 30 (2023), pp. 1173-1201.
dc.identifier.bibliographicCitationX.X. Ma, W. Yao, J.J. Ye and J. Zhang, Calm local optimality for nonconvex-nonconcave minimax problems, arXiv preprint arXiv:2306.17443, 2023.
dc.identifier.urihttps://hdl.handle.net/1828/19214
dc.languageEnglisheng
dc.language.isoen
dc.rightsAvailable to the World Wide Web
dc.subjectpartial calmness
dc.subjectbilevel program
dc.subjectlocal optimality
dc.subjectminimax problem
dc.subjectoptimality condition
dc.titleOn bilevel programs and minimax problems
dc.typeThesis

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Ma_Xiaoxiao_PhD_2024.pdf
Size:
811.76 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description: