paper-with-me

홈 › Papers

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem

2025-07-21 · Kuangyu Ding, Kim-Chuan Toh arxiv

We study a nonsmooth nonconvex optimization problem defined over nonconvex constraints, where the feasible set is given by the intersection of the closure of an open set and a smooth manifold. By endowing the open set with a Riemannian metric induced by a barrier function, we obtain a Riemannian subgradient flow formulated as a differential inclusion, which remains strictly within the interior of the feasible set. This continuous dynamical system unifies two classes of iterative optimization methods, namely the Hessian barrier method and mirror descent scheme, by revealing that these methods can be interpreted as discrete approximations of the continuous flow. We explore the long-term behavior of the trajectories generated by this dynamical system and show that the existing deficient convergence properties of the Hessian barrier and mirror descent scheme can be unifily and more insightfully interpreted through these of the continuous trajectory. For instance, the notorious spurious stationary points \cite{chen2024spurious} observed in Hessian barrier method and mirror descent scheme are interpreted as stable equilibria of the dynamical system that do not correspond to real stationary points of the original optimization problem. We provide two sufficient condition such that these spurious stationary points can be avoided if the strict complementarity conditions holds. In the absence of these regularity condition, we propose a random perturbation strategy that ensures the trajectory converges (subsequentially) to an approximate stationary point. Building on these insights, we introduce two iterative Riemannian subgradient methods, form of interior point methods, that generalizes the existing Hessian barrier method and mirror descent scheme for solving nonsmooth nonconvex optimization problems.

📄 PDF Abstract BibTeX arXiv:2507.15264

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Flow Matching Policy Optimization with Mirror Descent and Entropy Constraints

2026-03-18 · Ting Gao, Stavros Orfanoudakis, Nan Lin, Winnie Daamen 외 arxiv

Balancing policy expressiveness with the exploration-exploitation trade-off is a core challenge in online Reinforcement Learning (RL). While Stochastic Differential Equation (SDE)-based diffusion policies can represent c…

Reinforcement Learning

Stochastic MeanFlow Policies: One-Step Generative Control with Entropic Mirror Descent

2026-05-20 · Zeyuan Wang, Da Li, Yulin Chen, Yuehu Gong 외 arxiv

Online off-policy reinforcement learning (RL) is shaped by two coupled choices: the policy class and the update rule. Gaussian policies are fast and have tractable entropy, but struggle with multimodal action distributio…

Reinforcement Learning

Second-Order Mirror Descent: Convergence in Games Beyond Averaging and Discounting

2021-11-18 · Bolin Gao, Lacra Pavel

In this paper, we propose a second-order extension of the continuous-time game-theoretic mirror descent (MD) dynamics, referred to as MD2, which provably converges to mere (but not necessarily strict) variationally stabl…

Convex Optimization: Algorithms and Complexity

2014-05-20 · Sébastien Bubeck

This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advan…

Stochastic Optimization

Entropy annealing for policy mirror descent in continuous time and space

2024-05-30 · Deven Sethi, David Šiška, Yufei Zhang

Entropy regularization has been widely used in policy optimization algorithms to enhance exploration and the robustness of the optimal control; however it also introduces an additional regularization bias. This work quan…

Policy Gradient Methods