A Generalized Alternating Linearization Bundle Method for Structured Convex Optimization with Inexact First-Order Oracles
In this paper, we consider a class of structured optimization problems whose objective function is the summation of two convex functions: <i>f</i> and <i>h</i>, which are not necessarily differentiable. We focus particularly on the case where the function <i>f</i>...
Main Authors: | Chunming Tang, Yanni Li, Xiaoxia Dong, Bo He |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-04-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/13/4/91 |
Similar Items
-
An Adaptive Proximal Bundle Method with Inexact Oracles for a Class of Nonconvex and Nonsmooth Composite Optimization
by: Xiaoliang Wang, et al.
Published: (2021-04-01) -
Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems
by: Manlio Gaudioso, et al.
Published: (2023-08-01) -
The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems
by: Gonglin Yuan, et al.
Published: (2012-04-01) -
A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints
by: Yaling Zhang, et al.
Published: (2020-01-01) -
Some Inexact Version of the Iterative Exponential Method for Solving Nonsmooth Equations
by: Marek J. Śmietański
Published: (2023-01-01)