A version of bundle trust region method with linear programming
From MaRDI portal
Publication:6086138
DOI10.1007/s10957-023-02293-2MaRDI QIDQ6086138
Yousong Luo, Andrew S. Eberhard, Shuai Liu
Publication date: 9 November 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonsmooth optimization via quasi-Newton methods
- A bundle-Newton method for nonsmooth unconstrained minimization
- Efficiency of proximal bundle methods
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Decomposition algorithms for stochastic programming on a computational grid
- Methods of descent for nondifferentiable optimization
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- A simple version of bundle method with linear programming
- Introduction to Nonsmooth Optimization
- An aggregate subgradient method for nonsmooth convex minimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Piecewise-quadratic Approximations in Convex Numerical Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Variational Analysis
- Trust Region Methods
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- Nonlinear Programming
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
This page was built for publication: A version of bundle trust region method with linear programming
