Dynamic bundle methods
From MaRDI portal
Recommendations
- New bundle methods for solving Lagrangian relaxation dual problems
- The omnipresence of Lagrange
- scientific article; zbMATH DE number 1953193
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
Cites work
- scientific article; zbMATH DE number 1064585 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 2196287 (Why is no real title available?)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A Lagrangian relaxation approach to the edge-weighted clique problem
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- 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 restricted Lagrangean approach to the traveling salesman problem
- A spectral bundle method with bounds
- Approximations in proximal bundle methods and decomposition of convex programs
- Bounds for the quadratic assignment problem using the bundle method
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Generalized Bundle Methods
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- How to deal with the unbounded in optimization: Theory and algorithms
- Methods of descent for nondifferentiable optimization
- New approaches for optimizing over the semimetric polytope
- New variants of bundle methods
- Newton's method for convex programming and Tschebyscheff approximation
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- The Cutting-Plane Method for Solving Convex Programs
- The volume algorithm revisited: relation with bundle methods
- The volume algorithm: Producing primal solutions with a subgradient method
- Validation of subgradient optimization
Cited in
(7)- New bundle methods for solving Lagrangian relaxation dual problems
- The chain rule for VU-decompositions of nonsmooth functions
- Using general triangle inequalities within quadratic convex reformulation method
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- An inexact spectral bundle method for convex quadratic semidefinite programming
- Non delayed relax-and-cut algorithms
- An asynchronous proximal bundle method
This page was built for publication: Dynamic bundle methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390994)
