A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information

DOI10.3934/jimo.2023057OpenAlexW4378471503MaRDI QIDQ6059582

Ziran Yin, Jinlong Yuan, Huimin Niu, Si-Da Lin, Ming Huang

Publication date: 2 November 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2023057

zbMATH Keywords

nonsmooth optimizationnonconvex optimizationbundle methodinexact informationlower-\(C^2\)

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The space decomposition theory for a class of eigenvalue optimizations
• Constrained nonconvex nonsmooth optimization via proximal bundle method
• Convex proximal bundle methods in depth: a unified analysis for inexact oracles
• A fast space-decomposition scheme for nonconvex eigenvalue optimization
• On approximations with finite precision in bundle methods for nonsmooth optimization
• Divide to conquer: decomposition methods for energy optimization
• Computing proximal points of nonconvex functions
• A superlinear space decomposition algorithm for constrained nonsmooth convex program
• An approximate decomposition algorithm for convex minimization
• Incremental-like bundle methods with application to energy planning
• Convergence analysis of some methods for minimizing a nonsmooth convex function
• Error stability properties of generalized gradient-type algorithms
• A bundle-Newton method for nonsmooth unconstrained minimization
• Approximate convexity and submonotonicity.
• Approximations in proximal bundle methods and decomposition of convex programs
• The effect of deterministic noise in subgradient methods
• The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
• A space decomposition scheme for maximum eigenvalue functions and its applications
• The bundle scheme for solving arbitrary eigenvalue optimizations
• A Redistributed Proximal Bundle Method for Nonconvex Optimization
• A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations
• Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
• On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball
• A Linearization Algorithm for Nonsmooth Minimization
• Submonotone Subdifferentials of Lipschitz Functions
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• Semismooth and Semiconvex Functions in Constrained Optimization
• Variational Analysis
• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
• Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
• Quasidifferentiabilities of the expectation functions of random quasidifferentiable functions
• Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
• An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
• A Proximal Bundle Method with Approximate Subgradient Linearizations
• Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
• Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
• A proximal bundle method based on approximate subgradients
• A proximal bundle method for nonsmooth nonconvex functions with inexact information

This page was built for publication: A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information