Dynamic bundle methods (Q2390994)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Dynamic bundle methods	scientific article

Statements

scholarly article

0 references

Dynamic bundle methods (English)

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

24 July 2009

0 references

zbMATH Keywords

hard constraints

0 references

dual problems

0 references

separation procedures

0 references

primal-dual convergence

0 references

Alexandre Belloni

0 references

Claudia A. Sagastizábal

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-008-0215-z

0 references

How to deal with the unbounded in optimization: Theory and algorithms

0 references

The volume algorithm: Producing primal solutions with a subgradient method

0 references

A restricted Lagrangean approach to the traveling salesman problem

0 references

Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM

0 references

0 references

The volume algorithm revisited: relation with bundle methods

0 references

Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem

0 references

Newton's method for convex programming and Tschebyscheff approximation

0 references

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships

0 references

A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems

0 references

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition

0 references

New approaches for optimizing over the semimetric polytope

0 references

Generalized Bundle Methods

0 references

A Cutting Plane Algorithm for the Linear Ordering Problem

0 references

0 references

A Lagrangian relaxation approach to the edge-weighted clique problem

0 references

A spectral bundle method with bounds

0 references

Validation of subgradient optimization

0 references

The Cutting-Plane Method for Solving Convex Programs

0 references

Methods of descent for nondifferentiable optimization

0 references

Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization

0 references

Approximations in proximal bundle methods and decomposition of convex programs

0 references

A Proximal Bundle Method with Approximate Subgradient Linearizations

0 references

0 references

New variants of bundle methods

0 references

A bundle-Newton method for nonsmooth unconstrained minimization

0 references

Globally convergent variable metric method for convex nonsmooth unconstrained minimization

0 references

Bounds for the quadratic assignment problem using the bundle method

0 references

0 references

On approximations with finite precision in bundle methods for nonsmooth optimization

0 references

A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10107-008-0215-z

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2390994

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2390994&oldid=35119956"