A Spectral Bundle Method for Semidefinite Programming
From MaRDI portal
Publication:4509732
DOI10.1137/S1052623497328987zbMath0960.65074OpenAlexW2051306216MaRDI QIDQ4509732
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
convergenceconvex optimizationeigenvalue optimizationsemidefinite programmingnumerical examplesproximal bundle methodlarge-scale problems
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Convex functions and convex programs in convex geometry (52A41)
Related Items
Numerical Study of Semidefinite Bounds for the k-cluster Problem, Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems, On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, Matrix Relaxations in Combinatorial Optimization, The bundle scheme for solving arbitrary eigenvalue optimizations, Mathematical Programming Models and Exact Algorithms, Metaheuristic Algorithms, Continuous quadratic programming formulations of optimization problems on graphs, A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations, A conversion of an SDP having free variables into the standard form SDP, A continuation algorithm for max-cut problem, The spectral bundle method with second-order information, Computational study of a branching algorithm for the maximum \(k\)-cut problem, A hierarchy of spectral relaxations for polynomial optimization, Algorithm unions for solving discrete optimization problems, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs, A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem, Solving combinatorial optimisation problems using oscillator based Ising machines, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Exponential extrapolation memory for tabu search, Solving graph equipartition SDPs on an algebraic variety, A preconditioned iterative interior point approach to the conic bundle subproblem, Local Search Based on Genetic Algorithms, Sparse basis pursuit for compliance minimization in the vanishing volume ratio limit, Optimal Convergence Rates for the Proximal Bundle Method, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, A guide to conic optimisation and its applications, A framework for solving mixed-integer semidefinite programs, An extended projective formula and its application to semidefinite optimization, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint, Semidefinite programming and combinatorial optimization, A projected gradient algorithm for solving the maxcut SDP relaxation, Second order cone programming relaxation of nonconvex quadratic optimization problems, An acceleration procedure for optimal first-order methods, Randomized heuristics for the Max-Cut problem, The trust region subproblem and semidefinite programming*, Local convergence of an augmented Lagrangian method for matrix inequality constrained programming, Identifying redundant linear constraints in systems of linear matrix inequality constraints, Block Coordinate Descent Methods for Semidefinite Programming, The State-of-the-Art in Conic Optimization Software, Computational Approaches to Max-Cut, Global Approaches for Facility Layout and VLSI Floorplanning, Discrete Optimization with Decision Diagrams, Solution Approaches for the Double-Row Equidistant Facility Layout Problem, Solving semidefinite programs using preconditioned conjugate gradients, Essentials of numerical nonsmooth optimization, A unifying framework for several cutting plane methods for semidefinite programming, Low-Rank Spectral Optimization via Gauge Duality, On convex parameterization of robust control design for minimizing (conditional) performance at risk, Subspace Acceleration for Large-Scale Parameter-Dependent Hermitian Eigenproblems, Computational enhancements in low-rank semidefinite programming, A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods, A Subspace Method for Large-Scale Eigenvalue Optimization, Essentials of numerical nonsmooth optimization, Mixed linear and semidefinite programming for combinatorial and quadratic optimization, Primal–dual first-order methods for a class of cone programming, Unnamed Item, A primal–dual regularized interior-point method for semidefinite programming, On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle, An SDP-based approach for computing the stability number of a graph, An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem, A successive constraint approach to solving parameter-dependent linear matrix inequalities, An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions, Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems, Douglas-Rachford splitting method for semidefinite programming, Using the eigenvalue relaxation for binary least-squares estimation problems, A second-order cone cutting surface method: Complexity and application, A computational study for bilevel quadratic programs using semidefinite relaxations, Generalized derivatives of eigenvalues of a symmetric matrix, Improved exact approaches for row layout problems with departments of equal length, A quality and distance guided hybrid algorithm for the vertex separator problem, A nonmonotone GRASP, LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison, IQC analysis and synthesis via nonsmooth optimization, A trust region method for solving semidefinite programs, Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem, A matrix generation approach for eigenvalue optimization, Semidefinite programming relaxations for graph coloring and maximal clique problems, Large-scale semidefinite programming via a saddle point mirror-prox algorithm, Solving large-scale semidefinite programs in parallel, Bounds for the quadratic assignment problem using the bundle method, On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods, Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization, The quadratic knapsack problem -- a survey, Stochastic nuclear outages semidefinite relaxations, A space decomposition scheme for maximum eigenvalue functions and its applications, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, Smoothing technique and its applications in semidefinite optimization, An exact semidefinite programming approach for the max-mean dispersion problem, SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances, Solving \(k\)-cluster problems to optimality with semidefinite programming, SDP-based branch-and-bound for non-convex quadratic integer optimization, Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel, The geometry of SDP-exactness in quadratic optimization, On some edge Folkman numbers, small and large, A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring, Knapsack problem with probability constraints, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, An incremental bundle method for portfolio selection problem under second-order stochastic dominance, A new discrete filled function method for solving large scale max-cut problems, A globally convergent filter-type trust region method for semidefinite programming, A novel neural network for solving semidefinite programming problems with some applications, The spherical constraint in Boolean quadratic programs, Solving the maxcut problem by the global equilibrium search, A feasible direction method for the semidefinite program with box constraints, A note on representations of linear inequalities in non-convex mixed-integer quadratic programs, A new approximation of the matrix rank function and its application to matrix rank minimization, Convex proximal bundle methods in depth: a unified analysis for inexact oracles, Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem, Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks, Optimization and stabilization of hierarchical electrical networks, A novel neural network model for solving a class of nonlinear semidefinite programming problems, A semidefinite programming-based heuristic for graph coloring, A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO), Hybridizing the cross-entropy method: An application to the max-cut problem, On semidefinite least squares and minimal unsatisfiability, Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation, A hybrid breakout local search and reinforcement learning approach to the vertex separator problem, A fast space-decomposition scheme for nonconvex eigenvalue optimization, An inexact spectral bundle method for convex quadratic semidefinite programming, Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms, A discrete dynamic convexized method for the max-cut problem, Semidefinite programming for discrete optimization and matrix completion problems, A parallel interior point decomposition algorithm for block angular semidefinite programs, A semidefinite programming heuristic for quadratic programming problems with complementarity constraints, Local minima and convergence in low-rank semidefinite programming, An efficient Lagrangian smoothing heuristic for max-cut, Lagrangian smoothing heuristics for Max-cut, A feasible method for optimization with orthogonality constraints, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, An improved semidefinite programming relaxation for the satisfiability problem, Parametric Lagrangian dual for the binary quadratic programming problem, Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem, Fast linear iterations for distributed averaging, T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, On extracting maximum stable sets in perfect graphs using Lovász's theta function, An efficient method for convex constrained rank minimization problems based on DC programming, A novel formulation of the max-cut problem and related algorithm, Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints, Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Faster, but weaker, relaxations for quadratically constrained quadratic programs, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems, Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Global optimization with orthogonality constraints via stochastic diffusion on manifold, An inexact dual logarithmic barrier method for solving sparse semidefinite programs, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, On filter-successive linearization methods for nonlinear semidefinite programming, Semidefinite programming, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem, Speeding up a memetic algorithm for the max-bisection problem, Nonsmooth bundle trust-region algorithm with applications to robust stability
Uses Software
