A new restricted memory level bundle method for constrained convex nonsmooth optimization
type: Item
instance of: scholarly article
title: A new restricted memory level bundle method for constrained convex nonsmooth optimization
zbMATH Open document ID: 1503.90095
published in: Optimization Letters
publication date: 2022-10-11T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7599795
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: level bundle method
zbMATH Keywords: restricted memory
zbMATH Keywords: localizer
zbMATH Keywords: complexity bound
author: Chun-Ming Tang
author: Yanni Li
author: Jinbao Jian
author: Haiyan Zheng
describes a project that uses: Mosek
describes a project that uses: PLCP
describes a project that uses: SLQP-GS
describes a project that uses: SQPlab
MaRDI profile type: Publication
full work available at URL: s11590-021-01835-9
OpenAlex ID: W4205974166
cites work: A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
cites work: Partitional clustering via nonsmooth optimization. Clustering via optimization
cites work: Non-Euclidean restricted memory level method for large-scale convex optimization
cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: Q4375488
cites work: Level bundle methods for oracles with on-demand accuracy
cites work: A doubly stabilized bundle method for nonsmooth convex optimization
cites work: Convex proximal bundle methods in depth: a unified analysis for inexact oracles
cites work: Benchmarking optimization software with performance profiles.
cites work: Generalized Bundle Methods
cites work: Generalized uniformly optimal methods for nonlinear programming
cites work: A proximal bundle method for nonsmooth nonconvex functions with inexact information
cites work: A feasible point method with bundle modification for nonsmooth convex constrained optimization
cites work: Efficient nonsmooth nonconvex optimization for image restoration and segmentation
cites work: A bundle-filter method for nonsmooth convex constrained optimization
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Methods of descent for nondifferentiable optimization
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
cites work: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
cites work: First-order and stochastic optimization methods for machine learning
cites work: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
cites work: Q4132264
cites work: New variants of bundle methods
cites work: A simple version of bundle method with linear programming
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: Survey of Bundle Methods for Nonsmooth Optimization
cites work: Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
cites work: An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: Q5187067
cites work: A multi-step doubly stabilized bundle method for nonsmooth convex optimization
cites work: Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
cites work: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
cites work: A proximal-projection partial bundle method for convex constrained minimax problems
cites work: Level bundle methods for constrained convex optimization with various oracles
cites work: Q4146571
cites work: Constrained nonconvex nonsmooth optimization via proximal bundle method
DOI: 10.1007/S11590-021-01835-9
description: scientific article; zbMATH DE number 7599795