A new restricted memory level bundle method for constrained convex nonsmooth optimization
From MaRDI portal
Publication:2080833
DOI10.1007/s11590-021-01835-9zbMath1503.90095OpenAlexW4205974166MaRDI QIDQ2080833
Hai-Yan Zheng, Chun-Ming Tang, Jin-Bao Jian, Yan-Ni Li
Publication date: 11 October 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01835-9
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A doubly stabilized bundle method for nonsmooth convex optimization
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Level bundle methods for constrained convex optimization with various oracles
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Proximity control in bundle methods for convex nondifferentiable minimization
- A bundle-filter method for nonsmooth convex constrained optimization
- Newton's method for convex programming and Tschebyscheff approximation
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- Partitional clustering via nonsmooth optimization. Clustering via optimization
- Methods of descent for nondifferentiable optimization
- First-order and stochastic optimization methods for machine learning
- A proximal-projection partial bundle method for convex constrained minimax problems
- Generalized uniformly optimal methods for nonlinear programming
- A simple version of bundle method with linear programming
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Efficient nonsmooth nonconvex optimization for image restoration and segmentation
- Level bundle methods for oracles with on-demand accuracy
- The Cutting-Plane Method for Solving Convex Programs
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Generalized Bundle Methods
- Survey of Bundle Methods for Nonsmooth Optimization
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Benchmarking optimization software with performance profiles.
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
