A Weighted Mirror Descent Algorithm for Nonsmooth Convex Optimization Problem

Journal of Optimization Theory and Applications- United States

doi 10.1007/s10957-016-0963-5

Full Text

Abstract

Available in

Categories

Management Science

Applied Mathematics

Operations Research

Date

June 14, 2016

Authors

Duy V. N. Luong

Daniel Rueckert

Publisher

Springer Science and Business Media LLC

Related search

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

INFORMS Journal on Optimization

Dutch

A Bundle-Filter Method for Nonsmooth Convex Constrained Optimization

Mathematical Programming, Series B

English

A Weighted Full-Newton Step Primal-Dual Interior Point Algorithm for Convex Quadratic Optimization

Statistics, Optimization and Information Computing

Information Systems

Pattern Recognition

Computer Vision

Signal Processing

Artificial Intelligence

English

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

Mathematical Programming, Series B

English

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

Abstract and Applied Analysis

Applied Mathematics

English

A Steepest Descent Algorithm for M-Convex Functions on Jump Systems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Electronic Engineering

Computer Graphics

Signal Processing

Applied Mathematics

Computer-Aided Design

English

Development of the Convex Subspace Single-Linkage Algorithm for Nonlinear Optimization Problem With Multicrestedness.

Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C

Mechanics of Materials

Mechanical Engineering

Manufacturing Engineering

English

3 the Convex Optimization Problem

English

An Online Algorithm for Smoothed Online Convex Optimization

Performance Evaluation Review

Computer Networks

English