A Spectral Bundle Method for Semidefinite Programming
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
- Algorithm unions for solving discrete optimization problems
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- A preconditioned iterative interior point approach to the conic bundle subproblem
- Essentials of numerical nonsmooth optimization
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- A framework for solving mixed-integer semidefinite programs
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- A globally convergent filter-type trust region method for semidefinite programming
- Spectral simplex method
- A unifying framework for several cutting plane methods for semidefinite programming
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- An exact semidefinite programming approach for the max-mean dispersion problem
- The Simplest Semidefinite Programs are Trivial
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- Mathematical programming models and exact algorithms
- On convex parameterization of robust control design for minimizing (conditional) performance at risk
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- 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
- Solving semidefinite programs using preconditioned conjugate gradients
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Semidefinite programming
- A matrix generation approach for eigenvalue optimization
- Optimal Convergence Rates for the Proximal Bundle Method
- IQC analysis and synthesis via nonsmooth optimization
- Local Search Based on Genetic Algorithms
- Numerical study of semidefinite bounds for the \(k\)-cluster problem
- A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM
- scientific article; zbMATH DE number 1861544 (Why is no real title available?)
- A new approximation of the matrix rank function and its application to matrix rank minimization
- A semidefinite programming-based heuristic for graph coloring
- Sparse basis pursuit for compliance minimization in the vanishing volume ratio limit
- An improved semidefinite programming relaxation for the satisfiability problem
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- An efficient Lagrangian smoothing heuristic for max-cut
- Cardinality-constrained structured data-fitting problems
- Computational enhancements in low-rank semidefinite programming
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- A novel neural network model for solving a class of nonlinear semidefinite programming problems
- Low-rank spectral optimization via gauge duality
- Semidefinite programming for discrete optimization and matrix completion problems
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems
- The geometry of SDP-exactness in quadratic optimization
- A guide to conic optimisation and its applications
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A spectral bundle method with bounds
- Essentials of numerical nonsmooth optimization
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- A new discrete filled function method for solving large scale max-cut problems
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Exploiting constant trace property in large-scale polynomial optimization
- Douglas-Rachford splitting method for semidefinite programming
- On extracting maximum stable sets in perfect graphs using Lovász's theta function
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Parametric Lagrangian dual for the binary quadratic programming problem
- Speeding up a memetic algorithm for the max-bisection problem
- Matrix relaxations in combinatorial optimization
- On filter-successive linearization methods for nonlinear semidefinite programming
- Solving large-scale semidefinite programs in parallel
- Computational approaches to MAX-cut
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
- Global optimization with orthogonality constraints via stochastic diffusion on manifold
- A conversion of an SDP having free variables into the standard form SDP
- Randomized heuristics for the Max-Cut problem
- Full-Newton step infeasible interior-point algorithm for SDO problems
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- An extended projective formula and its application to semidefinite optimization
- Improved exact approaches for row layout problems with departments of equal length
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- A novel formulation of the max-cut problem and related algorithm
- Metaheuristic algorithms
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Bounds for the quadratic assignment problem using the bundle method
- Continuous quadratic programming formulations of optimization problems on graphs
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Generalized derivatives of eigenvalues of a symmetric matrix
- 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
- Knapsack problem with probability constraints
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Stochastic nuclear outages semidefinite relaxations
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Semidefinite programming and combinatorial optimization
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
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)
