The following pages link to (Q4735938):
Displayed 50 items.
- A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
- Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment (Q486936) (← links)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
- Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- BoxStep methods for crew pairing problems (Q833409) (← links)
- Lagrangian bounds from decision diagrams (Q890004) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← links)
- Maximum likelihood identification of stable linear dynamical systems (Q1716471) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems (Q1753575) (← links)
- Two approaches to stochastic optimal control problems with a final-time expectation constraint (Q1754665) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Ranking lower bounds for the bin-packing problem (Q1887861) (← links)
- A decomposition algorithm for KYP-SDPs (Q1937316) (← links)
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems (Q2150773) (← links)
- Optimizing stop plan and tickets allocation for high-speed railway based on uncertainty theory (Q2153571) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs (Q2392808) (← links)
- Uncontrolled inexact information within bundle methods (Q2397754) (← links)
- A Lagrangian propagator for artificial neural networks in constraint programming (Q2398510) (← links)
- On parallelizing dual decomposition in stochastic integer programming (Q2450615) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming (Q2494825) (← links)
- Solving network design problems via iterative aggregation (Q2516352) (← links)
- On a primal-proximal heuristic in discrete optimization (Q2571002) (← links)
- A primal-proximal heuristic applied to the French unit-commitment problem (Q2571007) (← links)
- A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
- On the decay of the smallest singular value of submatrices of rectangular matrices (Q3181168) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- Efficient Learning of Interpretable Classification Rules (Q5043563) (← links)
- Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields (Q5043730) (← links)
- Exact penalties for decomposable convex optimization problems (Q5058390) (← links)
- The omnipresence of Lagrange (Q5920487) (← links)