A simple version of bundle method with linear programming
From MaRDI portal
Recommendations
Cites work
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A bundle-Newton method for nonsmooth unconstrained minimization
- A descent method with linear programming subproblems for nondifferentiable convex optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A proximity control algorithm to minimize nonsmooth and nonconvex functions
- A redistributed proximal bundle method for nonconvex optimization
- A science fiction story in nonsmooth optimization originating at IIASA
- A splitting bundle approach for non-smooth non-convex minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Convergence of some algorithms for convex minimization
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Decomposition algorithms for stochastic programming on a computational grid
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Generalized Bundle Methods
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Methods of descent for nondifferentiable optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- New variants of bundle methods
- Newton's method for convex programming and Tschebyscheff approximation
- Nonlinear optimization.
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On approximations with finite precision in bundle methods for nonsmooth optimization
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Piecewise-quadratic approximations in convex numerical optimization
- Regularized optimization methods for convex MINLP problems
- The Cutting-Plane Method for Solving Convex Programs
- Variational Analysis
Cited in
(6)- A new restricted memory level bundle method for constrained convex nonsmooth optimization
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- A version of bundle trust region method with linear programming
- Bundle trust region algorithm based on linear subproblem
- New bundle methods for solving Lagrangian relaxation dual problems
- A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds
This page was built for publication: A simple version of bundle method with linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419511)
