A Spectral Bundle Method for Semidefinite Programming
From MaRDI portal
DOI10.1137/S1052623497328987zbMATH Open0960.65074OpenAlexW2051306216MaRDI QIDQ4509732FDOQ4509732
Authors: Christoph Helmberg, Franz Rendl 
Publication date: 19 October 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497328987
Recommendations
convergenceconvex optimizationnumerical examplessemidefinite programmingeigenvalue optimizationproximal bundle methodlarge-scale problems
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Semidefinite programming (90C22) Convex functions and convex programs in convex geometry (52A41)
Cited In (only showing first 100 items - show all)
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- A globally convergent filter-type trust region method for semidefinite programming
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- The Simplest Semidefinite Programs are Trivial
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- An exact semidefinite programming approach for the max-mean dispersion problem
- Mathematical programming models and exact algorithms
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- Solving semidefinite programs using preconditioned conjugate gradients
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- A second-order cone cutting surface method: Complexity and application
- Using the eigenvalue relaxation for binary least-squares estimation problems
- Local Search Based on Genetic Algorithms
- An efficient Lagrangian smoothing heuristic for max-cut
- A novel neural network model for solving a class of nonlinear semidefinite programming problems
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- On extracting maximum stable sets in perfect graphs using Lovász's theta function
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Parametric Lagrangian dual for the binary quadratic programming problem
- Matrix relaxations in combinatorial optimization
- Computational approaches to MAX-cut
- Solving large-scale semidefinite programs in parallel
- Global optimization with orthogonality constraints via stochastic diffusion on manifold
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Improved exact approaches for row layout problems with departments of equal length
- A novel formulation of the max-cut problem and related algorithm
- Continuous quadratic programming formulations of optimization problems on graphs
- Bounds for the quadratic assignment problem using the bundle method
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
- Solution approaches for the double-row equidistant facility layout problem
- Identifying redundant linear constraints in systems of linear matrix inequality constraints
- Semidefinite programming and combinatorial optimization
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- A hierarchy of spectral relaxations for polynomial optimization
- A continuation algorithm for max-cut problem
- The spectral bundle method with second-order information
- An efficient method for convex constrained rank minimization problems based on DC programming
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- Primal-dual first-order methods for a class of cone programming
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
- Title not available (Why is that?)
- A feasible direction method for the semidefinite program with box constraints
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- A successive constraint approach to solving parameter-dependent linear matrix inequalities
- An SDP-based approach for computing the stability number of a graph
- A novel neural network for solving semidefinite programming problems with some applications
- On semidefinite least squares and minimal unsatisfiability
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- A unifying framework for several cutting plane methods for semidefinite programming
- Spectral simplex method
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Semidefinite programming
- Numerical study of semidefinite bounds for the \(k\)-cluster problem
- A matrix generation approach for eigenvalue optimization
- IQC analysis and synthesis via nonsmooth optimization
- A semidefinite programming-based heuristic for graph coloring
- Computational enhancements in low-rank semidefinite programming
- A new approximation of the matrix rank function and its application to matrix rank minimization
- An improved semidefinite programming relaxation for the satisfiability problem
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- Low-rank spectral optimization via gauge duality
- Semidefinite programming for discrete optimization and matrix completion problems
- The geometry of SDP-exactness in quadratic optimization
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A spectral bundle method with bounds
- A new discrete filled function method for solving large scale max-cut problems
- Douglas-Rachford splitting method for semidefinite programming
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Speeding up a memetic algorithm for the max-bisection problem
- On filter-successive linearization methods for nonlinear semidefinite programming
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Randomized heuristics for the Max-Cut problem
- Full-Newton step infeasible interior-point algorithm for SDO problems
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Smoothing technique and its applications in semidefinite optimization
- A computational study for bilevel quadratic programs using semidefinite relaxations
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Knapsack problem with probability constraints
- Stochastic nuclear outages semidefinite relaxations
- An inexact spectral bundle method for convex quadratic semidefinite programming
- Fast linear iterations for distributed averaging
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- A feasible method for optimization with orthogonality constraints
- The trust region subproblem and semidefinite programming*
- Hybridizing the cross-entropy method: An application to the max-cut problem
- Solving the maxcut problem by the global equilibrium search
Uses Software
This page was built for publication: A Spectral Bundle Method for Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509732)
