An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
type: Item
instance of: scholarly article
title: An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
zbMATH Open document ID: 1474.90328
author: Hui Gao
author: Jian Lv
author: Xiaoliang Wang
author: Li-Ping Pang
published in: Journal of Industrial and Management Optimization
publication date: 2021-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 7356908
zbMATH Keywords: bundle method
zbMATH Keywords: inexact oracle
zbMATH Keywords: alternating linearization
zbMATH Keywords: local convexification
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: jimo.2019135
OpenAlex ID: W2982168117
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Q3151174
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: Approximate convexity and submonotonicity.
cites work: Incremental-like bundle methods with application to energy planning
cites work: Fast alternating linearization methods for minimizing the sum of two convex functions
cites work: Computing proximal points of nonconvex functions
cites work: A Redistributed Proximal Bundle Method for Nonconvex Optimization
cites work: A proximal bundle method for nonsmooth nonconvex functions with inexact information
cites work: An Algorithm for Nonsmooth Convex Minimization With Errors
cites work: An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
cites work: A Proximal Bundle Method with Approximate Subgradient Linearizations
cites work: A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
cites work: Proximal Decomposition Via Alternating Linearization
cites work: A proximal alternating linearization method for nonconvex optimization problems
cites work: An approximate alternating linearization decomposition method
cites work: A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
cites work: An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
cites work: An approximate bundle method for solving nonsmooth equilibrium problems
cites work: Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
cites work: Inexact Bundle Methods for Two-Stage Stochastic Programming
cites work: Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
cites work: Variational Analysis
cites work: On approximations with finite precision in bundle methods for nonsmooth optimization
cites work: Submonotone Subdifferentials of Lipschitz Functions
cites work: A proximal-projection partial bundle method for convex constrained minimax problems
cites work: An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
cites work: Constrained nonconvex nonsmooth optimization via proximal bundle method
DOI: 10.3934/JIMO.2019135
Recommended article: An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
Recommended article: An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
Recommended article: A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
Recommended article: A class of alternating linearization algorithms for nonsmooth convex optimization
Recommended article: Q5016929
Recommended article: A proximal bundle method for nonsmooth nonconvex functions with inexact information
Recommended article: An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
Recommended article: An approximate bundle method for non-convex optimization and its dual problem
Recommended article: A proximal alternating linearization method for nonconvex optimization problems
Recommended article: An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems
description: scientific article; zbMATH DE number 7356908