“Relative Continuity” for Non-Lipschitz Nonsmooth Convex Optimization Using Stochastic (Or Deterministic) Mirror Descent

INFORMS Journal on Optimization

doi 10.1287/ijoo.2018.0008

Full Text

Abstract

Available in

Date

October 1, 2019

Authors

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

A Weighted Mirror Descent Algorithm for Nonsmooth Convex Optimization Problem

Journal of Optimization Theory and Applications

Management Science

Applied Mathematics

Operations Research

English

A Proximal Cutting Plane Method Using Chebychev Center for Nonsmooth Convex Optimization

Mathematical Programming, Series B

English

A Bundle-Filter Method for Nonsmooth Convex Constrained Optimization

Mathematical Programming, Series B

English

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

Mathematics of Operations Research

Management Science

Computer Science Applications

Operations Research

English

Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization

Proceedings of the AAAI Conference on Artificial Intelligence

English

A Stochastic Coordinate Descent for Bound Constrained Global Optimization

English

Deterministic and Stochastic Primal-Dual Subgradient Algorithms for Uniformly Convex Minimization

Stochastic Systems

English

A Proximal Point Method for Nonsmooth Convex Optimization Problems in Banach Spaces

Abstract and Applied Analysis

Applied Mathematics

English

Convex Optimization-Based Controller Design for Stochastic Nonlinear Systems Using Contraction Analysis

English