Pages that link to "Item:Q1749445"
From MaRDI portal
The following pages link to DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445):
Displayed 6 items.
- Estimation from nonlinear observations via convex programming with application to bilinear regression (Q2002578) (← links)
- D.C. programming for sparse proximal support vector machines (Q2056280) (← links)
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
- Block-sparse recovery of semidefinite systems and generalized null space conditions (Q2197151) (← links)
- On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
- A linear programming approach to difference-of-convex piecewise linear approximation (Q6090153) (← links)