Pages that link to "Item:Q5136070"
From MaRDI portal
The following pages link to Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070):
Displaying 9 items.
- \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty (Q1740549) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- Convex optimization under combinatorial sparsity constraints (Q2102824) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- Combination of two underestimators for univariate global optimization (Q4579891) (← links)
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems (Q5210512) (← links)
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems (Q6134435) (← links)
- Finite element approximation of data-driven problems in conductivity (Q6622728) (← links)