A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
From MaRDI portal
Publication:2104108
DOI10.1016/j.cam.2022.114949zbMath1499.65235OpenAlexW4309102041MaRDI QIDQ2104108
Xiantao Xiao, Li-Ping Pang, Xiaoliang Wang
Publication date: 9 December 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.114949
proximal bundle methodpenalty techniqueinexact oraclesdisaggregate strategynonconvex and nonsmooth constrained optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Uses Software
Cites Work
- Unnamed Item
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- A bundle-filter method for nonsmooth convex constrained optimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Approximate convexity and submonotonicity.
- 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
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
- Generalized monotone line search SQP algorithm for constrained minimax problems
- Submonotone Subdifferentials of Lipschitz Functions
- Variational Analysis
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- 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
