Pages that link to "Item:Q2161551"
From MaRDI portal
The following pages link to Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551):
Displaying 6 items.
- Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient (Q2045943) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Boolean Methods of Optimization over Independence Systems (Q3337220) (← links)
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)