Pages that link to "Item:Q4509732"
From MaRDI portal
The following pages link to A Spectral Bundle Method for Semidefinite Programming (Q4509732):
Displayed 50 items.
- A feasible method for optimization with orthogonality constraints (Q101635) (← links)
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Douglas-Rachford splitting method for semidefinite programming (Q295495) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- A trust region method for solving semidefinite programs (Q354640) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- Solving the maxcut problem by the global equilibrium search (Q466339) (← links)
- A new approximation of the matrix rank function and its application to matrix rank minimization (Q481777) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks (Q490355) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
- An efficient Lagrangian smoothing heuristic for max-cut (Q549567) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- A feasible direction method for the semidefinite program with box constraints (Q654206) (← links)
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- IQC analysis and synthesis via nonsmooth optimization (Q864474) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm (Q868467) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Smoothing technique and its applications in semidefinite optimization (Q879964) (← links)
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel (Q895077) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Hybridizing the cross-entropy method: An application to the max-cut problem (Q954050) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869) (← links)
- Semidefinite programming (Q1600854) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)