A Primal-Dual Algorithmic Framework for Constrained Convex Minimization

2014-06-20 · Quoc Tran-Dinh, Volkan Cevher

We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical constrained convex optimization problem, and rigorously characterize how common structural assumptions affect the numerical efficiency. Our main analysis technique provides a fresh perspective on Nesterov's excessive gap technique in a structured fashion and unifies it with smoothing and primal-dual methods. For instance, through the choices of a dual smoothing strategy and a center point, our framework subsumes decomposition algorithms, augmented Lagrangian as well as the alternating direction method-of-multipliers methods as its special cases, and provides optimal convergence rates on the primal objective residual as well as the primal feasibility gap of the iterates for all.

📄 PDF Abstract BibTeX arXiv:1406.5403

Code (0)

등록된 구현이 없습니다.

A Universal Primal-Dual Convex Optimization Framework

2015-12-01 · NeurIPS 2015 12 · Alp Yurtsever, Quoc Tran Dinh, Volkan Cevher

We propose a new primal-dual algorithmic framework for a prototypical constrained convex optimization template. The algorithmic instances of our framework are universal since they can automatically adapt to the unknown H…

Vocal Bursts Type Prediction

Constrained convex minimization via model-based excessive gap

2014-12-01 · NeurIPS 2014 12 · Quoc Tran-Dinh, Volkan Cevher

We introduce a model-based excessive gap technique to analyze first-order primal- dual methods for constrained convex minimization. As a result, we construct first- order primal-dual methods with optimal convergence rate…

model

A Primal Approach to Constrained Policy Optimization: Global Optimality and Finite-Time Analysis

2020-09-28 · Tengyu Xu, Yingbin Liang, Guanghui Lan

Safe reinforcement learning (SRL) problems are typically modeled as constrained Markov Decision Process (CMDP), in which an agent explores the environment to maximize the expected total reward and meanwhile avoids violat…

Safe Reinforcement Learning

CRPO: A New Approach for Safe Reinforcement Learning with Convergence Guarantee

2020-11-11 · Tengyu Xu, Yingbin Liang, Guanghui Lan

In safe reinforcement learning (SRL) problems, an agent explores the environment to maximize an expected total reward and meanwhile avoids violation of certain constraints on a number of expected total costs. In general,…

reinforcement-learning Reinforcement Learning (RL)Safe Reinforcement Learning

Dynamic Convex Duality in Constrained Utility Maximization

2016-12-13

In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the …