An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
From MaRDI portal
Publication:647397
Recommendations
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- On methods for the convex multi-commodity flow problem
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1424526 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Cholesky dual method for proximal piecewise linear programming
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- A bundle-type algorithm for routing in telecommunication data networks
- A survey of algorithms for convex multicommodity flow problems
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum
- An inexact bundle variant suited to column generation
- Convex Analysis
- Lagrangian Relaxation via Ballstep Subgradient Methods
- Monotone Operators and the Proximal Point Algorithm
- Proximal Decomposition Via Alternating Linearization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
Cited in
(12)- scientific article; zbMATH DE number 7071840 (Why is no real title available?)
- A proximal alternating linearization method for nonconvex optimization problems
- Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
- A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- Primal convergence from dual subgradient methods for convex optimization
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- A class of alternating linearization algorithms for nonsmooth convex optimization
This page was built for publication: An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647397)
