A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
From MaRDI portal
Recommendations
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- Approximations in proximal bundle methods and decomposition of convex programs
- On approximations with finite precision in bundle methods for nonsmooth optimization
Cited in
(12)- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- A proximal-projection partial bundle method for convex constrained minimax problems
- A class of alternating linearization algorithms for nonsmooth convex optimization
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Dynamic bundle methods
- An inexact bundle variant suited to column generation
This page was built for publication: A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426895)
