Pages that link to "Item:Q1749445"
From MaRDI portal
The following pages link to DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445):
Displaying 11 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)
- Representation of a polynomial function as a difference of convex polynomials, with an application (Q2751334) (← links)
- A linear programming approach to difference-of-convex piecewise linear approximation (Q6090153) (← 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)
- On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)
- Higher-order Newton methods with polynomial work per iteration (Q6608710) (← links)
