Back to search

University of British Columbia

Regularities in variational analysis and their applications in nonconvex optimization

Abstract

dc:description

In this thesis, we investigate regularities in variational analysis and explore their algorithmic applications. The term "regularities" refers to favorable properties of functions and operators that lead to pleasant behavior of algorithms designed for convex problems in the absence of convexity, including the Kurdyka-Łojasiewicz property and variational convexity. We extend the forward-reflected-backward splitting method—a convex optimization algorithm—and its variations to nonconvex setting, both with and without a traditional assumption on Lipschitz smoothness. Our analysis hinges on analyzing merit functions associated with nonconvex extensions of the forward-reflected-backward splitting method that decrease along iterates generated by these algorithms. The Kurdyka-Łojasiewicz property guarantees these extensions converge globally to a stationary point of the objective function and more. We investigate systematically the level proximal subdifferential by characterizing its existence, single-valuedness, connection to Lipschitz smoothness, and more. These results reveal the level proximal subdifferential provides deep insights into variational analysis and optimization, which, among other things, lead to novel characterizations of variational convexity and of Lipschitz-type properties of proximal operators in the absence of convexity. We also investigate calculus rules and algorithmic applications of variational convexity. Aided by these results, new insights regarding the local behavior of several celebrated algorithms in nonconvex setting are obtained. Finally, we introduce the left and right Bregman level proximal subdifferentials and investigate them systematically. New correspondences among properties of the Bregman proximal operators, the underlying functions, and the associated subdifferential operators are also established. Asymmetry and duality gap occur in this process as consequences of Bregman distance.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy - PhD
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Mathematics
Grantor dc:publisher
University of British Columbia
Year dc:date
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wang, Ziyuan
Contributors dc:contributor
  • Wang, Xianfu

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/91263

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Wang, Ziyuan. Regularities in variational analysis and their applications in nonconvex optimization. doctoral thesis, University of British Columbia, 2025. http://hdl.handle.net/2429/91263