A version of bundle trust region method with linear programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A bundle-Newton method for nonsmooth unconstrained minimization
- A proximity control algorithm to minimize nonsmooth and nonconvex functions
- A redistributed proximal bundle method for nonconvex optimization
- A simple version of bundle method with linear programming
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- An aggregate subgradient method for nonsmooth convex minimization
- Decomposition algorithms for stochastic programming on a computational grid
- Efficiency of proximal bundle methods
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Introduction to nonsmooth optimization. Theory, practice and software
- Methods of descent for nondifferentiable optimization
- Nonlinear Programming
- Nonlinear optimization.
- Nonsmooth optimization via quasi-Newton methods
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Piecewise-quadratic approximations in convex numerical optimization
- Trust Region Methods
- Variational Analysis
This page was built for publication: A version of bundle trust region method with linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086138)