scientific article; zbMATH DE number 2084780
From MaRDI portal
Publication:4735938
Recommendations
Cited in
(73)- 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
- Lagrangean ralaxation revisited. (Technical note)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- Maximum likelihood identification of stable linear dynamical systems
- 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
- A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems
- Two approaches to stochastic optimal control problems with a final-time expectation constraint
- Lagrangean relaxation. (With comments and rejoinder).
- Ranking lower bounds for the bin-packing problem
- A decomposition algorithm for KYP-SDPs
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- 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
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Lagrangian relaxation of the generic materials and operations planning model
- Calculating the best dual bound for problems with multiple Lagrangian relaxations
- 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
- On parallelizing dual decomposition in stochastic integer programming
- Relaxation in presence of pointwise gradient constraints
- Comparison of bundle and classical column generation
- Computation of approximate -points for large scale single machine scheduling problem
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Solving network design problems via iterative aggregation
- 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
- A bundle-type algorithm for routing in telecommunication data networks
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- Decomposition algorithm for large-scale two-stage unit-commitment
- A tutorial on dual decomposition and Lagrangian relaxation for inference in natural language processing
- On the decay of the smallest singular value of submatrices of rectangular matrices
- An approach to robust network design in telecommunications
- Lagrangian relaxation for integer programming
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- scientific article; zbMATH DE number 1094769 (Why is no real title available?)
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment
- Efficient Learning of Interpretable Classification Rules
- Lifting the convex conjugate in Lagrangian relaxations: a tractable approach for continuous Markov random fields
- Exact penalties for decomposable convex optimization problems
- 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
- scientific article; zbMATH DE number 5173819 (Why is no real title available?)
- Principles and Practice of Constraint Programming – CP 2004
- The omnipresence of Lagrange
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- 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
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
- Refinement of Lagrangian bounds in optimization problems
- Optimal Convergence Rates for the Proximal Bundle Method
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Integrated production and transportation scheduling problem under nonlinear cost structures
- A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
- Implementation of an oracle-structured bundle method for distributed optimization
- An asynchronous proximal bundle method
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems
- Divide to conquer: decomposition methods for energy optimization
- About Lagrangian methods in integer optimization
- BoxStep methods for crew pairing problems
- Solving the p-median problem with a semi-Lagrangian relaxation
- Lagrangian bounds from decision diagrams
- The spherical constraint in Boolean quadratic programs
- A Lagrangian bound for many-to-many assignment problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735938)
