A spectral bundle method with bounds

DOI10.1007/s101070100270zbMath1065.90059OpenAlexW2069313750MaRDI QIDQ1396209

Krzysztof C. Kiwiel, Christoph Helmberg

Publication date: 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100270

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex functions and convex programs in convex geometry (52A41) Extreme-point and pivoting methods (90C49)

Related Items

On verified numerical computations in convex programming, Dynamic bundle methods, LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison, The spectral bundle method with second-order information, Solving large-scale semidefinite programs in parallel, Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization, A space decomposition scheme for maximum eigenvalue functions and its applications, Could we use a million cores to solve an integer program?, A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem, Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, A preconditioned iterative interior point approach to the conic bundle subproblem, Risk Management with Stochastic Dominance Models in Energy Systems with Dispersed Generation, Risk Aversion in Two-Stage Stochastic Integer Programming, A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO), A fast space-decomposition scheme for nonconvex eigenvalue optimization, A parallel interior point decomposition algorithm for block angular semidefinite programs, On deviation measures in stochastic integer programming, An improved semidefinite programming relaxation for the satisfiability problem, The State-of-the-Art in Conic Optimization Software, Global Approaches for Facility Layout and VLSI Floorplanning, A unifying framework for several cutting plane methods for semidefinite programming, Lagrangian decompositions for the two-level FTTx network design problem, Risk neutral and risk averse power optimization in electricity networks with dispersed generation, Computational enhancements in low-rank semidefinite programming, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods, Conditional value-at-risk in stochastic programs with mixed-integer recourse, Nonsmooth bundle trust-region algorithm with applications to robust stability