The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors

Numerical Functional Analysis and Optimization ◽

10.1080/01630563.2010.489248 ◽

2010 ◽

Vol 31 (5) ◽

pp. 616-633 ◽

Author(s):

Alexander J. Zaslavski

Keyword(s):

Convex Optimization ◽

Subgradient Method ◽

Nonsmooth Convex Optimization ◽

Computational Errors

Download Full-text

On the projected subgradient method for nonsmooth convex optimization in a Hilbert space

Mathematical Programming ◽

10.1007/bf01584842 ◽

1998 ◽

Vol 81 (1) ◽

pp. 23-35 ◽

Author(s):

Ya. I. Alber ◽

A. N. Iusem ◽

M. V. Solodov

Keyword(s):

Hilbert Space ◽

Convex Optimization ◽

Subgradient Method ◽

Nonsmooth Convex Optimization

Download Full-text

Incremental subgradient method for nonsmooth convex optimization with fixed point constraints

Optimization Methods and Software ◽

10.1080/10556788.2016.1175002 ◽

2016 ◽

Vol 31 (5) ◽

pp. 931-951 ◽

Author(s):

H. Iiduka

Keyword(s):

Fixed Point ◽

Convex Optimization ◽

Subgradient Method ◽

Nonsmooth Convex Optimization

Download Full-text

Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings

Fixed Point Theory and Applications ◽

10.1186/s13663-015-0319-0 ◽

2015 ◽

Vol 2015 (1) ◽

Author(s):

Hideaki Iiduka

Keyword(s):

Fixed Point ◽

Parallel Computing ◽

Convex Optimization ◽

Nonexpansive Mappings ◽

Subgradient Method ◽

Nonsmooth Convex Optimization ◽

Fixed Point Sets

Download Full-text

Gradient-Free Two-Point Methods for Solving Stochastic Nonsmooth Convex Optimization Problems with Small Non-Random Noises

Автоматика и телемеханика ◽

10.31857/s000523100001245-3 ◽

2018 ◽

pp. 38-49

Author(s):

Anastasya Bayandina ◽

◽

Aleksandr Gasnikov ◽

Anastasya Lagunovskaya ◽

◽

...

Keyword(s):

Convex Optimization ◽

Optimization Problems ◽

Nonsmooth Convex Optimization ◽

Convex Optimization Problems

Download Full-text

Variational Analysis Perspective on Linear Convergence of Some First Order Methods for Nonsmooth Convex Optimization Problems

Set-Valued and Variational Analysis ◽

10.1007/s11228-021-00591-3 ◽

2021 ◽

Author(s):

Jane J. Ye ◽

Xiaoming Yuan ◽

Shangzhi Zeng ◽

Jin Zhang

Keyword(s):

Convex Optimization ◽

Variational Analysis ◽

Optimization Problems ◽

Linear Convergence ◽

Nonsmooth Convex Optimization ◽

First Order ◽

Convex Optimization Problems ◽

First Order Methods

Download Full-text

An interior-point based subgradient method for nondifferentiable convex optimization

Optimization Methods and Software ◽

10.1080/10556789808805711 ◽

1998 ◽

Vol 10 (2) ◽

pp. 197-215

Author(s):

J. B. G. Frenk ◽

J. F. Sturm ◽

S. Zhang

Keyword(s):

Convex Optimization ◽

Interior Point ◽

Subgradient Method

Download Full-text

Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces

Journal of Global Optimization ◽

10.1007/s10898-021-01110-2 ◽

2021 ◽

Author(s):

Regina S. Burachik ◽

Yaohua Hu ◽

Xiaoqi Yang

Keyword(s):

Convex Optimization ◽

Hilbert Spaces ◽

Optimization Problems ◽

Subgradient Method ◽

Convex Optimization Problems ◽

Euclidean Distances

Download Full-text

A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization

Journal of Industrial & Management Optimization ◽

10.3934/jimo.2017075 ◽

2018 ◽

Vol 14 (2) ◽

pp. 785-801

Author(s):

Yigui Ou ◽

◽

Xin Zhou

Keyword(s):

Convex Optimization ◽

Conjugate Gradient ◽

Conjugate Gradient Algorithm ◽

Gradient Algorithm ◽

Preconditioned Conjugate Gradient ◽

Nonsmooth Convex Optimization

Download Full-text

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

INFORMS Journal on Optimization ◽

10.1287/ijoo.2018.0008 ◽

2019 ◽

Vol 1 (4) ◽

pp. 288-303 ◽

Author(s):

Haihao Lu

Keyword(s):

Convex Optimization ◽

Nonsmooth Convex Optimization ◽

Download Full-text

Distributed Event-Triggered Subgradient Method for Convex Optimization with a Common Constraint Set

IFAC-PapersOnLine ◽

10.1016/j.ifacol.2017.08.2449 ◽

2017 ◽

Vol 50 (1) ◽

pp. 15319-15324 ◽

Author(s):

Yuichi Kajiyama ◽

Naoki Hayashi ◽

Shigemasa Takai

Keyword(s):

Convex Optimization ◽

Subgradient Method ◽

Constraint Set ◽

Event Triggered

Download Full-text