Pages that link to "Item:Q1396209"
From MaRDI portal
The following pages link to A spectral bundle method with bounds (Q1396209):
Displaying 31 items.
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Risk neutral and risk averse power optimization in electricity networks with dispersed generation (Q1014316) (← links)
- Numerical evaluation of SBmethod (Q1411646) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
- On deviation measures in stochastic integer programming (Q2488193) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods (Q2576741) (← links)
- Conditional value-at-risk in stochastic programs with mixed-integer recourse (Q2583132) (← links)
- The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- The spectral bundle method with second-order information (Q2926057) (← links)
- Risk Aversion in Two-Stage Stochastic Integer Programming (Q3001274) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- Risk Management with Stochastic Dominance Models in Energy Systems with Dispersed Generation (Q4613825) (← links)
- Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)
- A preconditioned iterative interior point approach to the conic bundle subproblem (Q6126660) (← links)
