“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 full text

Date
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
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2016English

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

Mathematical Programming, Series B
MathematicsSoftware
2008English

A Bundle-Filter Method for Nonsmooth Convex Constrained Optimization

Mathematical Programming, Series B
MathematicsSoftware
2007English

Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

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

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2017English

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

Stochastic Systems
2014English

A Stochastic Coordinate Descent for Bound Constrained Global Optimization

2019English

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

2019English

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

Abstract and Applied Analysis
Applied MathematicsAnalysis
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy