Numerical reduction method for doubly nonnegative optimization problems
From MaRDI portal
Recommendations
- Application of a facial reduction algorithm and an inexact primal-dual path-following method for doubly nonnegative relaxation for mixed binary nonconvex quadratic optimization problems
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
- A proximal DC approach for quadratic assignment problem
Cited in
(7)- Numerical reduced variable optimization methods via implicit functional dependence with applications
- scientific article; zbMATH DE number 4143788 (Why is no real title available?)
- Application of a facial reduction algorithm and an inexact primal-dual path-following method for doubly nonnegative relaxation for mixed binary nonconvex quadratic optimization problems
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- Double greedy algorithms: Reduced basis methods for transport dominated problems
- On degenerate doubly nonnegative projection problems
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
This page was built for publication: Numerical reduction method for doubly nonnegative optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2923297)