SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594): Difference between revisions

Latest revision as of 11:12, 29 July 2024

scientific article; zbMATH DE number 7549332

Language	Label	Description	Also known as
English	SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning	scientific article; zbMATH DE number 7549332

Statements

instance of

scholarly article

0 references

title

SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (English)

0 references

0 references

0 references

INFORMS Journal on Computing

0 references

publication date

28 June 2022

0 references

full work available at URL

https://arxiv.org/abs/2009.03616

0 references

zbMATH Keywords

quadratic cycle cover problem

0 references

semidefinite programming

0 references

facial reduction

0 references

cutting-plane method

0 references

Dykstra's projection algorithm

0 references

reinforcement learning

0 references

describes a project that uses

SDPNAL+

0 references

ADMM_QAP

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The Angular-Metric Traveling Salesman Problem

0 references

Optimal Covering Tours with Turn Costs

0 references

A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems

0 references

Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces

0 references

Q3916398

0 references

Q3739782

0 references

Solving Lift-and-Project Relaxations of Binary Integer Programs

0 references

Assignment Problems

0 references

Minimum reload cost cycle cover in complete graphs

0 references

Iterative methods for fixed point problems in Hilbert spaces

0 references

On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs

0 references

The quadratic cycle cover problem: special cases and efficient bounds

0 references

An Algorithm for Restricted Least Squares Regression

0 references

Deriving solution value bounds from the ADMM

0 references

Covering tours and cycle covers with turn costs: hardness and approximation

0 references

Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics

0 references

A cyclic projection algorithm via duality

0 references

On minimum reload cost cycle cover

0 references

Hybrid evolutionary algorithms for graph coloring

0 references

A survey of local search methods for graph coloring

0 references

A successive projection method

0 references

Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes

0 references

A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming

0 references

Validation of subgradient optimization

0 references

Using tabu search techniques for graph coloring

0 references

Computing a nearest symmetric positive semidefinite matrix

0 references

On Solving the Quadratic Shortest Path Problem

0 references

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

0 references

Rigorous Error Bounds for the Optimal Value in Semidefinite Programming

0 references

ADMM for the SDP relaxation of the QAP

0 references

The Boolean quadratic polytope: Some characteristics, facets and relatives

0 references

A boundary point method to solve semidefinite programs

0 references

Geometric and LP-based heuristics for angular travelling salesman problems in the plane

0 references

SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)

0 references

On the Slater condition for the SDP relaxations of nonconvex sets

0 references

Alternating direction augmented Lagrangian methods for semidefinite programming

0 references

Reload cost problems: Minimum diameter spanning tree

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

Identifiers

DOI

10.1287/ijoc.2021.1075

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5084594

@@ Property / describes a project that uses @@
+ADMM_QAP
@@ Property / describes a project that uses: ADMM_QAP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3206965766
@@ Property / OpenAlex ID: W3206965766 / rank @@
+Normal rank
@@ Property / cites work @@
+The Angular-Metric Traveling Salesman Problem
@@ Property / cites work: The Angular-Metric Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Covering Tours with Turn Costs
@@ Property / cites work: Optimal Covering Tours with Turn Costs / rank @@
+Normal rank
@@ Property / cites work @@
+A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
+Normal rank
@@ Property / cites work @@
+Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
+Normal rank
@@ Property / cites work @@
+Q3916398
@@ Property / cites work: Q3916398 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3739782
@@ Property / cites work: Q3739782 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Lift-and-Project Relaxations of Binary Integer Programs
+Normal rank
@@ Property / cites work @@
+Assignment Problems
@@ Property / cites work: Assignment Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum reload cost cycle cover in complete graphs
+Normal rank
@@ Property / cites work @@
+Iterative methods for fixed point problems in Hilbert spaces
+Normal rank
@@ Property / cites work @@
+On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+The quadratic cycle cover problem: special cases and efficient bounds
+Normal rank
@@ Property / cites work @@
+An Algorithm for Restricted Least Squares Regression
+Normal rank
@@ Property / cites work @@
+Deriving solution value bounds from the ADMM
@@ Property / cites work: Deriving solution value bounds from the ADMM / rank @@
+Normal rank
@@ Property / cites work @@
+Covering tours and cycle covers with turn costs: hardness and approximation
+Normal rank
@@ Property / cites work @@
+Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
+Normal rank
@@ Property / cites work @@
+A cyclic projection algorithm via duality
@@ Property / cites work: A cyclic projection algorithm via duality / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum reload cost cycle cover
@@ Property / cites work: On minimum reload cost cycle cover / rank @@
+Normal rank
@@ Property / cites work @@
+Hybrid evolutionary algorithms for graph coloring
@@ Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of local search methods for graph coloring
+Normal rank
@@ Property / cites work @@
+A successive projection method
@@ Property / cites work: A successive projection method / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
+Normal rank
@@ Property / cites work @@
+A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Using tabu search techniques for graph coloring
@@ Property / cites work: Using tabu search techniques for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a nearest symmetric positive semidefinite matrix
+Normal rank
@@ Property / cites work @@
+On Solving the Quadratic Shortest Path Problem
@@ Property / cites work: On Solving the Quadratic Shortest Path Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
+Normal rank
@@ Property / cites work @@
+Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+ADMM for the SDP relaxation of the QAP
@@ Property / cites work: ADMM for the SDP relaxation of the QAP / rank @@
+Normal rank
@@ Property / cites work @@
+The Boolean quadratic polytope: Some characteristics, facets and relatives
+Normal rank
@@ Property / cites work @@
+A boundary point method to solve semidefinite programs
+Normal rank
@@ Property / cites work @@
+Geometric and LP-based heuristics for angular travelling salesman problems in the plane
+Normal rank
@@ Property / cites work @@
+SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
+Normal rank
@@ Property / cites work @@
+On the Slater condition for the SDP relaxations of nonconvex sets
+Normal rank
@@ Property / cites work @@
+Alternating direction augmented Lagrangian methods for semidefinite programming
+Normal rank
@@ Property / cites work @@
+Reload cost problems: Minimum diameter spanning tree
+Normal rank
@@ Property / cites work @@
+A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
+Normal rank