Publication:4735938

Publication date: 9 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2241/22410112.htm

Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Decomposition algorithm for large-scale two-stage unit-commitment, Lagrangean relaxation. (With comments and rejoinder)., Efficient Learning of Interpretable Classification Rules, Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields, BoxStep methods for crew pairing problems, Ranking lower bounds for the bin-packing problem, Exact penalties for decomposable convex optimization problems, On the decay of the smallest singular value of submatrices of rectangular matrices, Computational efficiency of the simplex embedding method in convex nondifferentiable optimization, An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems, Optimizing stop plan and tickets allocation for high-speed railway based on uncertainty theory, Certification aspects of the fast gradient method for solving the dual of parametric convex programs, Uncontrolled inexact information within bundle methods, A Lagrangian propagator for artificial neural networks in constraint programming, A bundle-type algorithm for routing in telecommunication data networks, On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods, Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization, An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions, Lagrangian bounds from decision diagrams, Matheuristics: survey and synthesis, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, An effective approach for optimization of a perishable inventory system with uncertainty in both demand and supply, A decomposition algorithm for KYP-SDPs, Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates, Optimal Convergence Rates for the Proximal Bundle Method, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, An approach to robust network design in telecommunications, Maximum likelihood identification of stable linear dynamical systems, The spherical constraint in Boolean quadratic programs, On parallelizing dual decomposition in stochastic integer programming, A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines, Large-scale unit commitment under uncertainty: an updated literature survey, Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems, A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems, Two approaches to stochastic optimal control problems with a final-time expectation constraint, Comparison of bundle and classical column generation, A fast space-decomposition scheme for nonconvex eigenvalue optimization, Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems, Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, A Lagrangian bound for many-to-many assignment problems, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Divide to conquer: decomposition methods for energy optimization, The omnipresence of Lagrange, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Solving network design problems via iterative aggregation, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, An inexact bundle variant suited to column generation, Two ``well-known properties of subgradient optimization, Lagrangian relaxation of the generic materials and operations planning model, A feasibility-ensured Lagrangian heuristic for general decomposable problems, On a primal-proximal heuristic in discrete optimization, A primal-proximal heuristic applied to the French unit-commitment problem, A decomposition method for large scale MILPs, with performance guarantees and a power system application, About Lagrangian methods in integer optimization